• Corpus ID: 118408716

An upper bound on quantum fault tolerant thresholds

@article{Fern2008AnUB,
  title={An upper bound on quantum fault tolerant thresholds},
  author={Jesse Fern},
  journal={arXiv: Quantum Physics},
  year={2008}
}
  • Jesse Fern
  • Published 17 January 2008
  • Physics, Mathematics
  • arXiv: Quantum Physics
In this paper we calculate upper bounds on fault tolerance, without restrictions on the overhead involved. Optimally adaptive recovery operators are used, and the Shannon entropy is used to estimate the thresholds. By allowing for unrealistically high levels of overhead, we find a quantum fault tolerant threshold of 6.88% for the depolarizing noise used by Knill, which compares well to "above 3%" evidenced by Knill. We conjecture that the optimal threshold is 6.90%, based upon the hashing rate… 
FLAG FAULT-TOLERANT ERROR CORRECTION WITH ARBITRARY DISTANCE CODES
Fault-tolerant error correction (EC) is desirable for performing large quantum computations. In this disclosure, example fault-tolerant EC protocols are disclosed that use flag circuits, which signal
New methods in quantum error correction and fault-tolerant quantum computing
TLDR
A new decoding algorithm is proposed which can optimize threshold values of error correcting codes under different noise models and is shown that for certain noise models, logical Clifford corrections can further improve a code’s threshold value if the code obeys certain symmetries.
Correctable noise of quantum-error-correcting codes under adaptive concatenation
We examine the transformation of noise under a quantum error correcting code (QECC) concatenated repeatedly with itself, by analyzing the effects of a quantum channel after each level of
Noise in quantum and classical computation & non-locality
htmlabstractQuantum computers seem to have capabilities which go beyond those of classical computers. A particular example which is important for cryptography is that quantum computers are able to

References

SHOWING 1-10 OF 24 REFERENCES
New Limits on Fault-Tolerant Quantum Computation
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,
Bounding fault-tolerant thresholds for purification and quantum computation
In this paper, we place bounds on when it is impossible to purify a noisy two-qubit state if all the gates used in the purification protocol are subject to adversarial, local, independent noise. It
Lower bounds on the nonzero capacity of Pauli channels
We study encodings that give the best known thresholds for the non-zero capacity of quantum channels, i.e., the upper bound for correctable noise, using an entropic approach to calculation of the
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
TLDR
New upper bounds on the tolerable level of noise in a quantum circuit are proved using a Pauli basis decomposition, finding that for p > 1 - Θ(1/√k), the output of any such circuit of large enough depth is essentially independent of its input, making the circuit useless.
Theory of fault-tolerant quantum computation
In order to use quantum error-correcting codes to improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a
Error-detection-based quantum fault tolerance against discrete pauli noise
A quantum computer---i.e., a computer capable of manipulating data in quantum superposition---would find applications including factoring, quantum simulation and tests of basic quantum theory. Since
Fault-tolerant quantum computation
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to
Correctable noise of quantum-error-correcting codes under adaptive concatenation
We examine the transformation of noise under a quantum error correcting code (QECC) concatenated repeatedly with itself, by analyzing the effects of a quantum channel after each level of
Fault-Tolerant Postselected Quantum Computation: Schemes
Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output must be accepted
Quantum computing with realistically noisy devices
  • E. Knill
  • Computer Science, Medicine
    Nature
  • 2005
TLDR
This work reports a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent, and shows that non-trivial quantum computations at EPG’s of as low as one per cent could be implemented.
...
1
2
3
...