Efficient state preparation for a register of quantum bits

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages, 3 figures, extended version

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Efficient state preparation for a register of quantum bits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient state preparation for a register of quantum bits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient state preparation for a register of quantum bits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-501160

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.