Abstract
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and inaccuracies. In this paper we show the results of simulations of a quantum computer which consider both decoherence and inaccuracies. We simulate circuits which factor the numbers 15, 21, 35, and 57 as well as circuits which use database search to solve the circuit satisfaction problem. Our simulations show that the error rate per gate is on the order of 10-6 for a trapped ion quantum computer whose noise is kept below π/4096 per gate and with a decoherence rate of 10-6. This is an important bound because previous studies have shown that a quantum computer can factor more efficiently than a classical computer if the error rate is of order 10-6.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Barenco et al. “Elementary Gates for Quantum Computation.„ Phys. R. A 52, 3457–3467. 1995.
M. Boyer et al. “Tight bounds on quantum searching.„ Proc. PhysComp96.
H.J. Carmichael. An Open Systems Approach to Quantum Optics, Lecture notes in Physics, (Springer, Berlin). 1993.
J.I. Cirac, and P. Zoller. “Quantum Computations with Cold Trapped Ions.„ Phys. Rev. Lett. 74, Number 20. May 15, 1995.
A. Despain. “Quantum Networks„ in Quantum Computing. JASON Report JSR-95-115. pp 49–81. The MITRE Corp. 1996.
D. Deutsch. “Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer.„ Proc. R. Soc. Lond. A 400, pp 97–117. 1985.
R. Feynman, R. Leighton, and M. Sands. The Feynman Lectures on Physics III. Addison-Wesley Publishing Company. 1965.
R. Feynman. “Quantum Mechanical Computers.„ Found. of Phys., 16, 1985.
L. Grover. “A Fast Quantum Mechanical Algorithm for Database Search.„ Proc., STOC 1996.
W. W. Hines, D. C. Montgomery. Probability and Statistics in Engineering and Management Science. John Wiley & Sons, Inc. 1980.
E. Knill et al. “Accuracy Threshold for Quantum Computation.„ 1996.
S. Lloyd. “Quantum-Mechanical Computers.„ Scientific American. Vol. 273, No. 4, pp 140–145. October 1995.
C. Monroe et al. “Demonstration of a Universal Quantum Logic Gate.„ Phys. Rev. Lett. 75, 4714. Dec. 1995.
K. Obenland, and A. Despain. “Models to Reduce the Complexity of Simulating a Quantum Computer.„ ISI Tech. Report. November 1997.
K. Obenland, and A. Despain. “Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer.„ ISI Tech. Report. December 1997.
K. Obenland, and A. Despain. “A Parallel Quantum Computer Simulator.„ High Performance Computing 1998.
J. Preskill. “Reliable Quantum Computers.„ Proc. R. Soc. Lond. A. 1996.
R.L. Rivest et al. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.„ Comm. ACM. 21, p 120. 1978.
P. Shor. “Algorithms for Quantum Computation: Discrete Logarithms and Factoring.„ Proc., 35th Annual FOCS pp. 124–134. November 1994.
A.M. Steane. “Multiple Particle Interference and Quantum Error Correction.„ Proc. R. Soc. Lond. A 452, 2551. 1996.
Q.A. Turchette et al. “Measurement of Conditional Phase Shifts for Quantum Logic.„ Phys. Rev. Lett. 75, 4710. Dec. 1995.
D. Wineland et al. “Quantum State manipulation of Trapped Atomic Ions.„ Proc. R. Soc. Lond. A. December 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Obenland, K.M., Despain, A.M. (1999). Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer. In: Williams, C.P. (eds) Quantum Computing and Quantum Communications. QCQC 1998. Lecture Notes in Computer Science, vol 1509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49208-9_41
Download citation
DOI: https://doi.org/10.1007/3-540-49208-9_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65514-5
Online ISBN: 978-3-540-49208-5
eBook Packages: Springer Book Archive