scholarly journals Key ideas in quantum error correction

2012 ◽  
Vol 370 (1975) ◽  
pp. 4541-4565 ◽  
Author(s):  
Robert Raussendorf
Keyword(s):  
Quantum Information ◽  
Error Correction ◽  
Quantum Computation ◽  
Fault Tolerant ◽  
Quantum Error Correction ◽  
Quantum Gates ◽  
Quantum Codes ◽  
Introductory Article ◽  
The Subject ◽  
Quantum Error

In this introductory article on the subject of quantum error correction and fault-tolerant quantum computation, we review three important ingredients that enter known constructions for fault-tolerant quantum computation, namely quantum codes, error discretization and transversal quantum gates. Taken together, they provide a ground on which the theory of quantum error correction can be developed and fault-tolerant quantum information protocols can be built.

scholarly journals Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes

2021 ◽  
Author(s):  
Dongsheng Wang ◽  
Yunjiang Wang ◽  
Ningping Cao ◽  
Bei Zeng ◽  
Raymond Lafflamme
Keyword(s):  
Error Correction ◽  
Quantum Computation ◽  
Fault Tolerant ◽  
Valence Bond ◽  
Quantum Error Correction ◽  
Quantum Codes ◽  
Error Correction Codes ◽  
Exact Quantum ◽  
Valence Bond Solid ◽  
Quantum Error

Abstract In this work, we develop the theory of quasi-exact fault-tolerant quantum (QEQ) computation, which uses qubits encoded into quasi-exact quantum error-correction codes (``quasi codes''). By definition, a quasi code is a parametric approximate code that can become exact by tuning its parameters. The model of QEQ computation lies in between the two well-known ones: the usual noisy quantum computation without error correction and the usual fault-tolerant quantum computation, but closer to the later. Many notions of exact quantum codes need to be adjusted for the quasi setting. Here we develop quasi error-correction theory using quantum instrument, the notions of quasi universality, quasi code distances, and quasi thresholds, etc. We find a wide class of quasi codes which are called valence-bond-solid codes, and we use them as concrete examples to demonstrate QEQ computation.

scholarly journals Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography

2017 ◽  
Vol 8 (1) ◽  
Author(s):  
Robin Blume-Kohout ◽  
John King Gamble ◽  
Erik Nielsen ◽  
Kenneth Rudinger ◽  
Jonathan Mizrahi ◽  
...  
Keyword(s):  
Quantum Information ◽  
Fault Tolerance ◽  
Error Correction ◽  
Error Rate ◽  
Fault Tolerant ◽  
Fast Algorithms ◽  
Quantum Error Correction ◽  
Qubit Operations ◽  
Quantum Error ◽  
Qubit Operation

Abstract Quantum information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably. Quantum error correction can protect against general noise if—and only if—the error in each physical qubit operation is smaller than a certain threshold. The threshold for general errors is quantified by their diamond norm. Until now, qubits have been assessed primarily by randomized benchmarking, which reports a different error rate that is not sensitive to all errors, and cannot be compared directly to diamond norm thresholds. Here we use gate set tomography to completely characterize operations on a trapped-Yb+-ion qubit and demonstrate with greater than 95% confidence that they satisfy a rigorous threshold for FTQEC (diamond norm ≤6.7 × 10−4).

scholarly journals Flag fault-tolerant error correction with arbitrary distance codes

Quantum ◽  
2018 ◽  
Vol 2 ◽  
pp. 53 ◽  
Author(s):  
Christopher Chamberland ◽  
Michael E. Beverland
Keyword(s):  
Error Correction ◽  
Fault Tolerant ◽  
Quantum Error Correction ◽  
Quantum Codes ◽  
Parity Check ◽  
Code Length ◽  
Stabilizer Codes ◽  
Low Density Parity Check ◽  
Quantum Error ◽  
First Time

In this paper we introduce a general fault-tolerant quantum error correction protocol using flag circuits for measuring stabilizers of arbitrary distance codes. In addition to extending flag error correction beyond distance-three codes for the first time, our protocol also applies to a broader class of distance-three codes than was previously known. Flag circuits use extra ancilla qubits to signal when errors resulting fromvfaults in the circuit have weight greater thanv. The flag error correction protocol is applicable to stabilizer codes of arbitrary distance which satisfy a set of conditions and uses fewer qubits than other schemes such as Shor, Steane and Knill error correction. We give examples of infinite code families which satisfy these conditions and analyze the behaviour of distance-three and -five examples numerically. Requiring fewer resources than Shor error correction, flag error correction could potentially be used in low-overhead fault-tolerant error correction protocols using low density parity check quantum codes of large code length.

scholarly journals New perspectives on covariant quantum error correction

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 521
Author(s):  
Sisi Zhou ◽  
Zi-Wen Liu ◽  
Liang Jiang
Keyword(s):  
Error Correction ◽  
Lower Bounds ◽  
Fault Tolerant ◽  
Symmetry Transformation ◽  
Substantial Improvement ◽  
Quantum Error Correction ◽  
Quantum Codes ◽  
Covariant Quantum ◽  
Continuous Symmetries ◽  
Quantum Error

Covariant codes are quantum codes such that a symmetry transformation on the logical system could be realized by a symmetry transformation on the physical system, usually with limited capability of performing quantum error correction (an important case being the Eastin–Knill theorem). The need for understanding the limits of covariant quantum error correction arises in various realms of physics including fault-tolerant quantum computation, condensed matter physics and quantum gravity. Here, we explore covariant quantum error correction with respect to continuous symmetries from the perspectives of quantum metrology and quantum resource theory, establishing solid connections between these formerly disparate fields. We prove new and powerful lower bounds on the infidelity of covariant quantum error correction, which not only extend the scope of previous no-go results but also provide a substantial improvement over existing bounds. Explicit lower bounds are derived for both erasure and depolarizing noises. We also present a type of covariant codes which nearly saturates these lower bounds.

scholarly journals QUANTUM ERROR CORRECTION FAILS FOR HAMILTONIAN MODELS

2006 ◽  
Vol 06 (03) ◽  
pp. C23-C28 ◽  
Author(s):  
R. ALICKI
Keyword(s):  
Error Correction ◽  
Quantum Computation ◽  
Discrete Time ◽  
Continuous Time ◽  
Fault Tolerant ◽  
Quantum Error Correction ◽  
Hamiltonian Models ◽  
Quantum Error ◽  
Discrete Time Models

It is argued that the existing schemes of fault-tolerant quantum computation, designed for discrete time models and based on quantum error correction, fail for continuous time Hamiltonian models, even with Markovian noise.

scholarly journals Exponential suppression of bit or phase errors with cyclic error correction

Nature ◽  
2021 ◽  
Vol 595 (7867) ◽  
pp. 383-387
Author(s):  
◽  
Zijun Chen ◽  
Kevin J. Satzinger ◽  
Juan Atalaya ◽  
Alexander N. Korotkov ◽  
...  
Keyword(s):  
Error Correction ◽  
Error Detection ◽  
Fault Tolerant ◽  
Error Rates ◽  
Quantum Error Correction ◽  
Superconducting Qubits ◽  
Two Dimensional ◽  
Logical Error ◽  
Quantum Error ◽  
Logical Qubit

AbstractRealizing the potential of quantum computing requires sufficiently low logical error rates1. Many applications call for error rates as low as 10−15 (refs. 2–9), but state-of-the-art quantum platforms typically have physical error rates near 10−3 (refs. 10–14). Quantum error correction15–17 promises to bridge this divide by distributing quantum logical information across many physical qubits in such a way that errors can be detected and corrected. Errors on the encoded logical qubit state can be exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold and stable over the course of a computation. Here we implement one-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits that demonstrate exponential suppression of bit-flip or phase-flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analysing error correlations with high precision, allowing us to characterize error locality while performing quantum error correction. Finally, we perform error detection with a small logical qubit using the 2D surface code on the same device18,19 and show that the results from both one- and two-dimensional codes agree with numerical simulations that use a simple depolarizing error model. These experimental demonstrations provide a foundation for building a scalable fault-tolerant quantum computer with superconducting qubits.

Sign in / Sign up

Export Citation Format

Share Document