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/0411010 · Optics and Spectroscopy

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

A. N. Soklakov, R. Schack

Published Aug 1, 2005• 5 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1134/1.2034606

Related papers

Efficient state preparation for a register of quantum bits

Andrei N. Soklakov, Rüdiger Schack

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.

arXiv:quant-ph/0408045•Physical Review A•Jan 9, 2006•125 citations

Preparing many copies of a quantum state in the black-box model

Yassine Hamoudi

We describe a simple quantum algorithm for preparing $K$ copies of an $N$-dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous work of Grover, who showed how to prepare one copy in time $O(\sqrt{N})$. In comparison with the naive $O(K\sqrt{N})$ solution obtained by repeating this procedure $K$ times, our algorithm achieves the optimal running time of $\mathrm{\ensuremath{\Theta}}(\sqrt{KN})$. Our technique uses a refinement of the quantum rejection sampling method employed by Grover. As a direct application, we obtain a similar speedup for obtaining $K$ independent samples from a distribution whose probability vector is given by a quantum oracle.

arXiv:2207.11014•Physical Review A•Jun 23, 2022•7 citations

Quantum State Preparation for Complex-Valued Amplitudes

Fred Sun

We present a state preparation procedure that takes binary registers containing the real and imaginary parts of a complex number $z=x+iy$ and prepares an amplitude approximating $z/α$, where $α$ is a normalization constant. The magnitude and argument are computed using the Coordinate Rotation Digital Computer (CORDIC) algorithm. We then encode the magnitude into an amplitude, and apply phase gates to introduce the argument. A reversible in-place multiplier allows the coordinate updates to use fixed precision while clearing their temporary workspace. The procedure uses $O(n^2)$ $T$ gates and $O(n)$ additional qubits. Compared with separately encoding the real and imaginary parts and combining them through LCU, the construction can allow a smaller normalization and reduce amplitude-amplification costs. The computed polar representation also remains available for further arithmetic before amplitude-encoding.

quant-pharXiv:2610.36680•Oct 28, 2026•0 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

Automatic Generation of an Efficient Less-Than Oracle for Quantum Amplitude Amplification

Javier Sanchez‐Rivero, Daniel Talaván, José Manuel García-Alonso +2 more

Grover's algorithm is a well-known contribution to quantum computing. It searches one value within an unordered sequence faster than any classical algorithm. A fundamental part of this algorithm is the so-called oracle, a quantum circuit that marks the quantum state corresponding to the desired value. A generalization of it is the oracle for Amplitude Amplification, that marks multiple desired states. In this work we present a classical algorithm that builds a phase-marking oracle for Amplitude Amplification. This oracle performs a less-than operation, marking states representing natural numbers smaller than a given one. Results of both simulations and experiments are shown to prove its functionality. This less-than oracle implementation works on any number of qubits and does not require any ancilla qubits. Regarding depth, the proposed implementation is compared with the one generated by Qiskit automatic method, UnitaryGate. We show that the depth of our less-than oracle implementation is always lower. This difference is significant enough for our method to outperform UnitaryGate on real quantum hardware.

arXiv:2303.07120•IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE)•May 1, 2023•16 citations

Description of the Grover algorithm based on geometric considerations

Gérard Fleury, Philippe Lacomme

This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure database of n entries finding a marked element with a quadratic speedup. The algorithm requires a predefined number of runs to succeed with probability close to one.This article provides a description of the amplitude amplification quantum algorithm mechanism in a very short computational way, based on tensor products and provides a geometric presentation of the successive system states. All the basis changes are fully described to provide an alternative to the wide spread Grover description based only on matrices and complex tensor computation. Our experiments encompass numerical evaluations of circuit using the Qiskit library of IBM that meet the theoretical considerations

arXiv:2210.16809•Oct 30, 2022•1 citation
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.
We describe a simple quantum algorithm for preparing KKK copies of an NNN-dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous work of Grover, who showed how to prepare one copy in time O(N)O(\sqrt{N})O(N​). In comparison with the naive O(KN)O(K\sqrt{N})O(KN​) solution obtained by repeating this procedure KKK times, our algorithm achieves the optimal running time of $\mathrm{\ensuremath{\Theta}}(\sqrt{KN})$. Our technique uses a refinement of the quantum rejection sampling method employed by Grover. As a direct application, we obtain a similar speedup for obtaining KKK independent samples from a distribution whose probability vector is given by a quantum oracle.
We present a state preparation procedure that takes binary registers containing the real and imaginary parts of a complex number z=x+iyz=x+iyz=x+iy and prepares an amplitude approximating z/αz/αz/α, where ααα is a normalization constant. The magnitude and argument are computed using the Coordinate Rotation Digital Computer (CORDIC) algorithm. We then encode the magnitude into an amplitude, and apply phase gates to introduce the argument. A reversible in-place multiplier allows the coordinate updates to use fixed precision while clearing their temporary workspace. The procedure uses O(n2)O(n^2)O(n2) TTT gates and O(n)O(n)O(n) additional qubits. Compared with separately encoding the real and imaginary parts and combining them through LCU, the construction can allow a smaller normalization and reduce amplitude-amplification costs. The computed polar representation also remains available for further arithmetic before amplitude-encoding.
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.
Grover's algorithm is a well-known contribution to quantum computing. It searches one value within an unordered sequence faster than any classical algorithm. A fundamental part of this algorithm is the so-called oracle, a quantum circuit that marks the quantum state corresponding to the desired value. A generalization of it is the oracle for Amplitude Amplification, that marks multiple desired states. In this work we present a classical algorithm that builds a phase-marking oracle for Amplitude Amplification. This oracle performs a less-than operation, marking states representing natural numbers smaller than a given one. Results of both simulations and experiments are shown to prove its functionality. This less-than oracle implementation works on any number of qubits and does not require any ancilla qubits. Regarding depth, the proposed implementation is compared with the one generated by Qiskit automatic method, UnitaryGate. We show that the depth of our less-than oracle implementation is always lower. This difference is significant enough for our method to outperform UnitaryGate on real quantum hardware.
This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure database of n entries finding a marked element with a quadratic speedup. The algorithm requires a predefined number of runs to succeed with probability close to one.This article provides a description of the amplitude amplification quantum algorithm mechanism in a very short computational way, based on tensor products and provides a geometric presentation of the successive system states. All the basis changes are fully described to provide an alternative to the wide spread Grover description based only on matrices and complex tensor computation. Our experiments encompass numerical evaluations of circuit using the Qiskit library of IBM that meet the theoretical considerations