Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer

Kevin Obenland, Alvin M. Despain

Published Jan 1, 1999• 17 citations
Publisher
DOI
10.1007/3-540-49208-9_41

Related papers

Decoherence, Inaccuracy and Errors in Quantum Cryptography

Sara Felloni

•Jan 1, 2008•0 citations

Effects of Decoherence in Quantum Simulations

Nayeli Zuniga-Hansen, Mark Byrd, Yu-Chieh Chi

Bulletin of the American Physical Society•Mar 24, 2011•0 citations

Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer

Kevin Obenland, Alvin M. Despain

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 pi/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.

arXiv:quant-ph/9804038•Apr 16, 1998•3 citations

Models to Reduce the Complexity of Simulating a Quantum Computer

Kevin Obenland, Alvin M. Despain

Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation is a useful tool for determining the feasibility of quantum computers in the presence of errors. The size of a quantum computer that can be simulat ed is small because faithfully modeling a quantum computer requires an exponential amount of storage and number of operations. In this paper we define simulation models to study the feasibility of quantum computers. The most detailed of these models is based directly on a proposed imple mentation. We also define less detailed models which are exponentially less complex but still pro duce accurate results. Finally we show that the two different types of errors, decoherence and inaccuracies, are uncorrelated. This decreases the number of simulations which must be per formed.

arXiv:quant-ph/9712004•Dec 2, 1997•3 citations

Decoherence in quantum computing: extended abstract

Vladimir Privman A

•Jan 5, 2004•0 citations

DECOHERENCE AND ITS IMPLICATIONS IN QUANTUM COMPUTATION AND INFORMATION TRANSFER

Yakir Aharonov, Alonso Botero, Sandu Popescu +2 more

•Jan 1, 2001•0 citations
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 pi/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.
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation is a useful tool for determining the feasibility of quantum computers in the presence of errors. The size of a quantum computer that can be simulat ed is small because faithfully modeling a quantum computer requires an exponential amount of storage and number of operations. In this paper we define simulation models to study the feasibility of quantum computers. The most detailed of these models is based directly on a proposed imple mentation. We also define less detailed models which are exponentially less complex but still pro duce accurate results. Finally we show that the two different types of errors, decoherence and inaccuracies, are uncorrelated. This decreases the number of simulations which must be per formed.