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

Decoherence, Inaccuracy and Errors in Quantum Cryptography

Sara Felloni

Published Jan 1, 2008• 0 citations
OpenAlex

Related papers

Quantum Error Correction and Quantum Cryptography

Masahito Hayashi, Satoshi Ishizaka, Akinori Kawachi +2 more

Graduate texts in physics•Aug 22, 2014•0 citations

Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer

Kevin Obenland, Alvin M. Despain

Lecture notes in computer science•Jan 1, 1999•17 citations

Error correction in quantum cryptography

El Ashmawy, Mohamed Salah

•Jan 1, 2005•2 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•5 citations

Fault-tolerant quantum computation

Peter W. Shor

It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer making long computations impossible. A further difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering long computations unreliable. However, these obstacles may not be as formidable as originally believed. For any quantum computation with t gates, we show how to build a polynomial size quantum circuit that tolerates O(1/log/sup c/t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O(1/t). We do this by showing that operations can be performed on quantum data encoded by quantum error-correcting codes without decoding this data.

arXiv:quant-ph/9605011•Annual Symposium on Foundations of Computer Science•Dec 23, 2002•1,195 citations

Analysis of the Impact of Quantum Measurement Reliability on Performance and Security in Quantum Cryptography Protocols: An Experimental Study Using Quantum Gates

Asia Alhammadi

Abstract This research investigates the critical role of quantum measurement reliability in the performance and security of quantum cryptography protocols, specifically focusing on the impact of noisy intermediate-scale quantum (NISQ) devices. Through a series of experimental studies conducted using quantum gates on IBM quantum computers (ibm_brisbane and ibm_torino), we analyze how measurement errors affect key performance indicators such as Quantum Bit Error Rate (QBER) and state fidelity. Our findings demonstrate that even minor inaccuracies in quantum measurements can significantly compromise the security and efficiency of quantum key distribution (QKD) protocols. We provide a comprehensive statistical analysis of the experimental data, including confidence intervals and error propagation, to quantify these effects. Furthermore, we delve into potential attack models, such as intercept-resend and Trojan-horse attacks, and discuss their susceptibility to measurement imperfections. This study highlights the urgent need for robust error mitigation and correction techniques to ensure the practical viability and cryptographic strength of quantum communication systems in the evolving quantum era.

•Aug 18, 2025•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.
It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer making long computations impossible. A further difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering long computations unreliable. However, these obstacles may not be as formidable as originally believed. For any quantum computation with t gates, we show how to build a polynomial size quantum circuit that tolerates O(1/log/sup c/t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O(1/t). We do this by showing that operations can be performed on quantum data encoded by quantum error-correcting codes without decoding this data.
Abstract This research investigates the critical role of quantum measurement reliability in the performance and security of quantum cryptography protocols, specifically focusing on the impact of noisy intermediate-scale quantum (NISQ) devices. Through a series of experimental studies conducted using quantum gates on IBM quantum computers (ibm_brisbane and ibm_torino), we analyze how measurement errors affect key performance indicators such as Quantum Bit Error Rate (QBER) and state fidelity. Our findings demonstrate that even minor inaccuracies in quantum measurements can significantly compromise the security and efficiency of quantum key distribution (QKD) protocols. We provide a comprehensive statistical analysis of the experimental data, including confidence intervals and error propagation, to quantify these effects. Furthermore, we delve into potential attack models, such as intercept-resend and Trojan-horse attacks, and discuss their susceptibility to measurement imperfections. This study highlights the urgent need for robust error mitigation and correction techniques to ensure the practical viability and cryptographic strength of quantum communication systems in the evolving quantum era.