Preparing Many Copies of a Quantum State in the Black-Box Model

Abstract

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 $\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 speed-up for obtaining $K$ independent samples from a distribution whose probability vector is given by a quantum oracle.

5 pages, 2 figures

References in corpus (6)

• Quantum algorithm for solving linear systems of equations
• Quantum-state preparation with universal gate decompositions
• Creating superpositions that correspond to efficiently integrable probability distributions
• Quantum Simulations of Classical Annealing Processes
• Speed-up via Quantum Sampling
• Wavefunction preparation and resampling using a quantum computer