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

Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation.

Noah Shutty, Mary K. Wootters, Patrick M. Hayden

Published Sep 25, 2018• 1 citation
OpenAlex

Related papers

Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing

Julia Kempe, Oded Regev, Falk Unger +1 more

Lecture notes in computer science•Jan 1, 2008•18 citations

A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing

Krysta M. Svore, Andrew W. Cross, Isaac L. Chuang +1 more

An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent estimates of the threshold are near some experimentally achieved gate fidelities. However, the landscape of threshold estimates includes pseudothresholds, threshold estimates based on a subset of components and a low level of the recursion. In this paper, we observe that pseudothresholds are a generic phenomenon in fault-tolerant computation. We define pseudothresholds and present classical and quantum fault-tolerant circuits exhibiting pseudothresholds that differ by a factor of $4$ from fault-tolerance thresholds for typical relationships between component failure rates. We develop tools for visualizing how reliability is influenced by recursive simulation in order to determine the asymptotic threshold. Finally, we conjecture that refinements of these methods may establish upper bounds on the fault-tolerance threshold for particular codes and noise models.

arXiv:quant-ph/0508176•Quantum Information and Computation•May 1, 2006•46 citations

Noise-resilient quantum circuits

Isaac H. Kim, Brian G. Swingle

Bulletin of the American Physical Society•Mar 7, 2018•0 citations

Fault-tolerant Quantum Implementation of Priority Encoder Circuit using Clifford+T-group

Laxmidhar Biswal, Khokan Mondal, Anirban Bhattacharjee +1 more

The high potential quantum computer has promised to solve classically intractable problems. In practicability of such high scalable general purpose quantum computer, the foremost challenge is to protect fragile quantum state from inherent noise sources. In this regards, the most promising surface code has been used for continuous encoding and decoding of quantum information so as to achieve fault tolerance. Besides, each code has threshold level within which the said code can detect and correct the error. The fault-tolerant quantum logic is used to contain error rate below threshold which needs transversal quantum operators. On the other hands, due to much difference the Boolean logic is no more useful in quantum computing. However, the quantum computer has to perform both classical solvable as well as classically intractable problem. In this conjecture, we focus on fault tolerant quantum implementation of Priority Encoder Circuit using Clifford+T gate library which is an essential component information processor.

International Symposium on Devices, Circuits and Systems (ISDCS)•Mar 4, 2020•3 citations

New Limits on Fault-Tolerant Quantum Computation

Harry Buhrman, Richard Cleve, Monique Laurent +3 more

We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of thetas = (6 - 2radic2)/7 ap 45%, thereby improving on a previous bound of 50% (due to Razborov, 2004). More precisely, the circuit model for which we prove this bound contains perfect gates from the Clifford group (CNOT, Hadamard, S, X, Y, Z) and arbitrary additional one-qubit gates that are subject to depolarizing noise thetas. We prove that this set of gates cannot be universal for arbitrary (even classical) computation, from which the upper bound on the noise threshold for fault-tolerant quantum computation follows

arXiv:quant-ph/0604141•Annual Symposium on Foundations of Computer Science•Jan 1, 2006•67 citations

Essentials on Quantum Noise

Daniele Cuomo

Springer theses•Jan 1, 2024•0 citations
An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent estimates of the threshold are near some experimentally achieved gate fidelities. However, the landscape of threshold estimates includes pseudothresholds, threshold estimates based on a subset of components and a low level of the recursion. In this paper, we observe that pseudothresholds are a generic phenomenon in fault-tolerant computation. We define pseudothresholds and present classical and quantum fault-tolerant circuits exhibiting pseudothresholds that differ by a factor of 444 from fault-tolerance thresholds for typical relationships between component failure rates. We develop tools for visualizing how reliability is influenced by recursive simulation in order to determine the asymptotic threshold. Finally, we conjecture that refinements of these methods may establish upper bounds on the fault-tolerance threshold for particular codes and noise models.
The high potential quantum computer has promised to solve classically intractable problems. In practicability of such high scalable general purpose quantum computer, the foremost challenge is to protect fragile quantum state from inherent noise sources. In this regards, the most promising surface code has been used for continuous encoding and decoding of quantum information so as to achieve fault tolerance. Besides, each code has threshold level within which the said code can detect and correct the error. The fault-tolerant quantum logic is used to contain error rate below threshold which needs transversal quantum operators. On the other hands, due to much difference the Boolean logic is no more useful in quantum computing. However, the quantum computer has to perform both classical solvable as well as classically intractable problem. In this conjecture, we focus on fault tolerant quantum implementation of Priority Encoder Circuit using Clifford+T gate library which is an essential component information processor.
We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of thetas = (6 - 2radic2)/7 ap 45%, thereby improving on a previous bound of 50% (due to Razborov, 2004). More precisely, the circuit model for which we prove this bound contains perfect gates from the Clifford group (CNOT, Hadamard, S, X, Y, Z) and arbitrary additional one-qubit gates that are subject to depolarizing noise thetas. We prove that this set of gates cannot be universal for arbitrary (even classical) computation, from which the upper bound on the noise threshold for fault-tolerant quantum computation follows