English
Related papers

Related papers: Comparing Experiments to the Fault-Tolerance Thres…

200 papers

Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates --…

Rigorously establishing that the error in an experimental quantum operation is beneath the threshold for fault-tolerant quantum computation currently requires considering the worst-case error, which can be orders of magnitude smaller than…

Quantum Physics · Physics 2016-11-02 Joel J. Wallman

A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography.…

Quantum error correcting codes are designed to pinpoint exactly when and where errors occur in quantum circuits. This feature is the foundation of their primary task: to support fault-tolerant quantum computation. However, this feature…

Quantum Physics · Physics 2024-03-18 James R. Wootton

The characterization of errors in a quantum system is a fundamental step for two important goals. First, learning about specific sources of error is essential for optimizing experimental design and error correction methods. Second,…

Quantum Physics · Physics 2020-08-24 Hillary Dawkins , Joel Wallman , Joseph Emerson

Gate fidelity -- an average fidelity over all possible input states -- is the workhorse metric for benchmarking quantum gates or circuits, yet fault-tolerant quantum computing ultimately depends on the worst-case behavior, typically…

Quantum Physics · Physics 2026-03-10 Kyoungho Cho , Ilkwon Sohn , Yongsoo Hwang , Jeongho Bang

The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here, through a series of numerical simulations, we investigate…

Quantum Physics · Physics 2014-02-18 Ashley M. Stephens

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 quantum superpositions are fragile, the…

Quantum Physics · Physics 2007-05-23 Ben W. Reichardt

Remarkable experimental advances in quantum computing are exemplified by recent announcements of impressive average gate fidelities exceeding 99.9% for single-qubit gates and 99% for two-qubit gates. Although these high numbers engender…

Quantum Physics · Physics 2015-12-29 Yuval R Sanders , Joel J Wallman , Barry C Sanders

Fault-tolerant quantum computing requires gates which function correctly despite the presence of errors, and are scalable if the error probability-per-gate is below a threshold value. To date, no method has been described for calculating…

We describe a scalable experimental protocol for obtaining estimates of the error rate of individual quantum computational gates. This protocol, in which random Clifford gates are interleaved between a gate of interest, provides a bounded…

I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for…

Quantum Physics · Physics 2008-02-03 Christof Zalka

The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…

Quantum Physics · Physics 2007-06-13 M. I. Dyakonov

Quantum measurements with feed-forward are crucial components of fault-tolerant quantum computers. We show how the error rate of such a measurement can be directly estimated by fitting the probability that successive randomly compiled…

Quantum Physics · Physics 2025-02-04 Darian McLaren , Matthew A. Graydon , Ali Assem Mahmoud , Joel J. Wallman

Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…

Quantum Physics · Physics 2011-02-22 David S. Wang , Austin G. Fowler , Lloyd C. L. Hollenberg

Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be…

Quantum Physics · Physics 2016-07-13 Ruben S. Andrist , Helmut G. Katzgraber , H. Bombin , M. A. Martin-Delgado

We describe and expand upon the scalable randomized benchmarking protocol proposed in Phys. Rev. Lett. 106, 180504 (2011) which provides a method for benchmarking quantum gates and estimating the gate-dependence of the noise. The protocol…

Quantum Physics · Physics 2012-04-30 Easwar Magesan , Jay M. Gambetta , Joseph Emerson

The quantum error threshold is the highest (model-dependent) noise rate which we can tolerate and still quantum-compute to arbitrary accuracy. Although noise thresholds are frequently estimated for the Steane seven-qubit, distance-three…

Quantum Physics · Physics 2007-05-23 Ben W. Reichardt

Accurate methods of assessing the performance of quantum gates are extremely important. Quantum process tomography and randomized benchmarking are the current favored methods. Quantum process tomography gives detailed information, but…

Quantum Physics · Physics 2014-05-08 Austin G. Fowler , D. Sank , J. Kelly , R. Barends , John M. Martinis

Threshold theorems for fault-tolerant quantum computing assume that errors are of certain types. But how would one detect whether errors of the "wrong" type occur in one's experiment, especially if one does not even know what type of error…

Quantum Physics · Physics 2015-06-16 Lucia Schwarz , Steven van Enk
‹ Prev 1 2 3 10 Next ›