Journal
PHYSICAL REVIEW A
Volume 73, Issue 1, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.73.012307
Keywords
-
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available