Physics – Quantum Physics
Scientific paper
1995-03-08
Physics
Quantum Physics
7 pages,LaTex + 2 postcript figures in a uuencoded file
Scientific paper
10.1126/science.270.5242.1633
In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large numbers -- a problem of great practical significance because of its cryptographic applications. Instead of the nearly exponential ($\sim \exp L^{1/3}$, for a number with $L$ digits) time required by the fastest classical algorithm, the quantum algorithm gives factors in a time polynomial in $L$ ($\sim L^2$). This enormous speed-up is possible in principle because quantum computation can simultaneously follow all of the paths corresponding to the distinct classical inputs, obtaining the solution as a result of coherent quantum interference between the alternatives. Hence, a quantum computer is sophisticated interference device, and it is essential for its quantum state to remain coherent in the course of the operation. In this report we investigate the effect of decoherence on the quantum factorization algorithm and establish an upper bound on a ``quantum factorizable'' $L$ based on the decoherence suffered per operational step.
Chuang Isaac
Laflamme Raymond
Shor Peter
Zurek Wojciech
No associations
LandOfFree
Quantum Computers, Factoring, and Decoherence 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 Quantum Computers, Factoring, and Decoherence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Computers, Factoring, and Decoherence will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-238436