Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0408045 · Physical Review A

Efficient state preparation for a register of quantum bits

Andrei N. Soklakov, Rüdiger Schack

Published Jan 9, 2006• 125 citations
arXivHTMLPDF

Abstract

We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of encoding a classical probability distribution in a quantum register.

DOI
10.1103/physreva.73.012307

Related papers

State preparation based on Grover’s algorithm in the presence of global information about the state

A. N. Soklakov, R. Schack

In a previous paper, we described an efficient algorithm to prepare an arbitrary state of a quantum register with arbitrarily high fidelity. Here we present an alternative algorithm that uses a small number of quantum oracles encoding the most significant bits of the absolute value of the complex amplitudes and, similarly, a small number of oracles encoding the most significant bits of the phases. The alternative algorithm is considerably simpler than the one described previously, on the assumption that a sufficient amount of knowledge about the distribution of the absolute values of the complex amplitudes is available.

arXiv:quant-ph/0411010•Optics and Spectroscopy•Aug 1, 2005•5 citations

EFFICIENT ALGORITHM FOR INITIALIZING AMPLITUDE DISTRIBUTION OF A QUANTUM REGISTER

M. Andrecut, Mazhar Ali

The preparation of a quantum register in an arbitrary superposed quantum state is an important operation for quantum computation and quantum information processing. Here, we present an efficient algorithm which requires a polynomial number of elementary operations for initializing the amplitude distribution of a quantum register.

Modern Physics Letters B•Nov 20, 2001•4 citations

Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers

Prithvi Gundlapalli, Junyi Lee

Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $|b⟩$. However, efficiently preparing $|b⟩$ is known to be a difficult problem because an arbitrary state of $Q$ qubits generally requires approximately ${2}^{Q}$ entangling gates, which results in significant decoherence on today's noisy intermediate-scale quantum (NISQ) computers. We present a deterministic (nonvariational) algorithm that allows us to flexibly reduce the quantum resources required for state preparation in an entanglement-efficient manner. Although this comes at the expense of reduced theoretical fidelity, actual fidelities on current NISQ computers might actually be higher due to reduced decoherence. We show this to be true for various cases of interest, such as the normal and log-normal distributions. For low-entanglement states, our algorithm can prepare states with more than an order of magnitude fewer entangling gates as compared with isometric decomposition.

arXiv:2110.13454•Physical Review Applied•Aug 4, 2022•19 citations

Quantum search simulation with Wolfram Mathematica

Alexander N. Prokopenya

We consider Grover's algorithm of quantum search for one or several integers out of N = 2n, where n is a number of quantum bits in the memory register. There is a black-box or subroutine containing information about hidden integers and it can easily recognize these integers but we do not know which ones out of N they are. To find the hidden items we can do no better with a classical computer than to apply the subroutine repeatedly to all possible integers until we hit on the special one and in the worst case we have to repeat this procedure N times. We have analyzed the Grover algorithm carefully and showed that it enables to speed up this search quadratically, although its realization requires to know a number of hidden items. The lower bound for the probability of successful solving the search problem has been obtained. The validity of the results was demonstrated by simulation of the Grover search algorithm using the package QuantumCircuit written in the Wolfram Mathematica language.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Sep 28, 2016•0 citations

Scheme for Entering Binary Data Into a Quantum Computer

Colin P. Williams

A quantum algorithm provides for the encoding of an exponentially large number of classical data bits by use of a smaller (polynomially large) number of quantum bits (qubits). The development of this algorithm was prompted by the need, heretofore not satisfied, for a means of entering real-world binary data into a quantum computer. The data format provided by this algorithm is suitable for subsequent ultrafast quantum processing of the entered data. Potential applications lie in disciplines (e.g., genomics) in which one needs to search for matches between parts of very long sequences of data. For example, the algorithm could be used to encode the N-bit-long human genome in only log2N qubits. The resulting log2N-qubit state could then be used for subsequent quantum data processing - for example, to perform rapid comparisons of sequences.

•Mar 1, 2005•0 citations

Logarithmic-depth quantum state preparation of polynomials

Baptiste Claudon, Alexis Lucas, Jean-Philip Piquemal +2 more

Quantum state preparation is a central primitive in many quantum algorithms, yet it is generally resource intensive, with efficient constructions known only for structured families of states. This work introduces a method for preparing quantum states whose amplitudes are given by a degree$-d$ polynomial, using circuits with logarithmic depth in the number $n$ of qubits and only $\mathcal O(n)$ ancilla qubits, improving previous approaches that required linear-depth circuits. The construction first relies on a block-encoding of an affine diagonal operator based on its Pauli-basis decomposition, which involves only $n$ terms. A modified linear-combination-of-unitaries (LCU) technique is introduced to implement this decomposition in logarithmic depth, together with a novel circuit for the EXACT-one oracle that flags basis states in which exactly one qubit is in the state $|1\rangle$. It then uses a generalized quantum eigenvalue transformation (GQET) to promote this affine operator to an arbitrary degree polynomial. Theoretical analysis and numerical simulations are reported along with a proof-of-principle implementation on a trapped-ion quantum processor using $14$ qubits and more than $500$ primitive quantum gates. Because polynomial approximations are ubiquitous in scientific computing, this construction provides a scalable and resource-efficient approach to quantum state preparation, further improving the potential of quantum algorithms in fields such as chemistry, physics, engineering, and finance.

quant-pharXiv:2603.16527•Mar 18, 2026•4 citations
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of encoding a classical probability distribution in a quantum register.
In a previous paper, we described an efficient algorithm to prepare an arbitrary state of a quantum register with arbitrarily high fidelity. Here we present an alternative algorithm that uses a small number of quantum oracles encoding the most significant bits of the absolute value of the complex amplitudes and, similarly, a small number of oracles encoding the most significant bits of the phases. The alternative algorithm is considerably simpler than the one described previously, on the assumption that a sufficient amount of knowledge about the distribution of the absolute values of the complex amplitudes is available.
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector b\mathbf{b}b is encoded in the amplitudes of a quantum state ∣b⟩|b⟩∣b⟩. However, efficiently preparing ∣b⟩|b⟩∣b⟩ is known to be a difficult problem because an arbitrary state of QQQ qubits generally requires approximately 2Q{2}^{Q}2Q entangling gates, which results in significant decoherence on today's noisy intermediate-scale quantum (NISQ) computers. We present a deterministic (nonvariational) algorithm that allows us to flexibly reduce the quantum resources required for state preparation in an entanglement-efficient manner. Although this comes at the expense of reduced theoretical fidelity, actual fidelities on current NISQ computers might actually be higher due to reduced decoherence. We show this to be true for various cases of interest, such as the normal and log-normal distributions. For low-entanglement states, our algorithm can prepare states with more than an order of magnitude fewer entangling gates as compared with isometric decomposition.
We consider Grover's algorithm of quantum search for one or several integers out of N = 2n, where n is a number of quantum bits in the memory register. There is a black-box or subroutine containing information about hidden integers and it can easily recognize these integers but we do not know which ones out of N they are. To find the hidden items we can do no better with a classical computer than to apply the subroutine repeatedly to all possible integers until we hit on the special one and in the worst case we have to repeat this procedure N times. We have analyzed the Grover algorithm carefully and showed that it enables to speed up this search quadratically, although its realization requires to know a number of hidden items. The lower bound for the probability of successful solving the search problem has been obtained. The validity of the results was demonstrated by simulation of the Grover search algorithm using the package QuantumCircuit written in the Wolfram Mathematica language.
A quantum algorithm provides for the encoding of an exponentially large number of classical data bits by use of a smaller (polynomially large) number of quantum bits (qubits). The development of this algorithm was prompted by the need, heretofore not satisfied, for a means of entering real-world binary data into a quantum computer. The data format provided by this algorithm is suitable for subsequent ultrafast quantum processing of the entered data. Potential applications lie in disciplines (e.g., genomics) in which one needs to search for matches between parts of very long sequences of data. For example, the algorithm could be used to encode the N-bit-long human genome in only log2N qubits. The resulting log2N-qubit state could then be used for subsequent quantum data processing - for example, to perform rapid comparisons of sequences.
Quantum state preparation is a central primitive in many quantum algorithms, yet it is generally resource intensive, with efficient constructions known only for structured families of states. This work introduces a method for preparing quantum states whose amplitudes are given by a degree−d-d−d polynomial, using circuits with logarithmic depth in the number nnn of qubits and only O(n)\mathcal O(n)O(n) ancilla qubits, improving previous approaches that required linear-depth circuits. The construction first relies on a block-encoding of an affine diagonal operator based on its Pauli-basis decomposition, which involves only nnn terms. A modified linear-combination-of-unitaries (LCU) technique is introduced to implement this decomposition in logarithmic depth, together with a novel circuit for the EXACT-one oracle that flags basis states in which exactly one qubit is in the state ∣1⟩|1\rangle∣1⟩. It then uses a generalized quantum eigenvalue transformation (GQET) to promote this affine operator to an arbitrary degree polynomial. Theoretical analysis and numerical simulations are reported along with a proof-of-principle implementation on a trapped-ion quantum processor using 141414 qubits and more than 500500500 primitive quantum gates. Because polynomial approximations are ubiquitous in scientific computing, this construction provides a scalable and resource-efficient approach to quantum state preparation, further improving the potential of quantum algorithms in fields such as chemistry, physics, engineering, and finance.