Physics – Quantum Physics
Scientific paper
1996-11-14
Physics
Quantum Physics
18 pages, now includes bibliography
Scientific paper
Recently Shor showed how to perform fault tolerant quantum computation when the error probability is logarithmically small. We improve this bound and describe fault tolerant quantum computation when the error probability is smaller than some constant threshold. The cost is polylogarithmic in time and space, and no measurements are used during the quantum computation. The result holds also for quantum circuits which operate on nearest neighbors only. To achieve this noise resistance, we use concatenated quantum error correcting codes. The scheme presented is general, and works with all quantum codes that satisfy some restrictions, namely that the code is ``proper''. We present two explicit classes of proper quantum codes. The first example of proper quantum codes generalizes classical secret sharing with polynomials. The second uses a known class of quantum codes and converts it to a proper code. This class is defined over a field with p elements, so the elementary quantum particle is not a qubit but a ``qupit''. With our codes, the threshold is about 10^(-6). Hopefully, this paper motivates a search for proper quantum codes with higher thresholds, at which point quantum computation becomes practical.
Aharonov Dorit
Ben-Or Michael
No associations
LandOfFree
Fault Tolerant Quantum Computation with Constant Error 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 Fault Tolerant Quantum Computation with Constant Error, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fault Tolerant Quantum Computation with Constant Error will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-605301