English
Related papers

Related papers: Noise Thresholds for the [[4, 2, 2]]-concatenated …

200 papers

We show that a simple modification of the surface code can exhibit an enormous gain in the error correction threshold for a noise model in which Pauli Z errors occur more frequently than X or Y errors. Such biased noise, where dephasing…

Quantum Physics · Physics 2018-02-07 David K. Tuckett , Stephen D. Bartlett , Steven T. Flammia

We compute the error threshold for the semion code, the companion of the Kitaev toric code with the same gauge symmetry group $\mathbb{Z}_2$. The application of statistical mechanical mapping methods is highly discouraged for the semion…

Quantum Physics · Physics 2020-09-23 Santiago Varona , Miguel Angel Martin-Delgado

Quantum error correction and fault-tolerance make it possible to perform quantum computations in the presence of imprecision and imperfections of realistic devices. An important question is to find the noise rate at which errors can be…

Quantum Physics · Physics 2016-06-30 Christopher Chamberland , Tomas Jochym-O'Connor , Raymond Laflamme

In the search for scalable, fault-tolerant quantum computing, distributed quantum computers are promising candidates. These systems can be realized in large-scale quantum networks or condensed onto a single chip with closely situated nodes.…

Quantum Physics · Physics 2024-07-11 Sébastian de Bone , Paul Möller , Conor E. Bradley , Tim H. Taminiau , David Elkouss

Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited…

Quantum Physics · Physics 2026-04-03 Julio C. Magdalena de la Fuente , Noa Feldman , Jens Eisert , Andreas Bauer

Biased-noise qubits, in which one type of error (e.g. $X$- and $Y$-type errors) is significantly suppressed relative to the other (e.g. $Z$-type errors), can significantly reduce the overhead of quantum error correction. Codes such as the…

Quantum Physics · Physics 2026-01-19 Peter Shanahan , Diego Ruiz

Tailored topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved subthreshold performance under biased Pauli noise. Three-dimensional (3D) topological codes can allow for…

Quantum Physics · Physics 2023-09-22 Eric Huang , Arthur Pesah , Christopher T. Chubb , Michael Vasmer , Arpit Dua

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes.…

We study how well topological quantum codes can tolerate coherent noise caused by systematic unitary errors such as unwanted $Z$-rotations. Our main result is an efficient algorithm for simulating quantum error correction protocols based on…

Quantum Physics · Physics 2018-11-01 Sergey Bravyi , Matthias Englbrecht , Robert Koenig , Nolan Peard

We introduce a fault-tolerant protocol for code concatenation of a generalized Shor code using a butterfly network architecture with high noise thresholds and low ancilla overhead to allow implementation on current devices. We develop a…

Quantum Physics · Physics 2025-11-03 Grace M. Sommers , Michael Foss-Feig , David Hayes , David A. Huse , Michael J. Gullans

Knill demonstrated a fault-tolerant quantum computation scheme based on concatenated error-detecting codes and postselection with a simulated error threshold of 3% over the depolarizing channel. %We design a two-dimensional architecture for…

Quantum Physics · Physics 2013-11-20 Ching-Yi Lai , Gerardo Paz , Martin Suchara , Todd A. Brun

In a recent work, Bombin, Duclos-Cianci, and Poulin showed that every local translationally invariant 2D topological stabilizer code is locally equivalent to a finite number of copies of Kitaev's toric code. For 2D color codes, Delfosse…

Quantum Physics · Physics 2015-04-28 Arjun Bhagoji , Pradeep Sarvepalli

Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an…

Quantum Physics · Physics 2026-04-17 Nico Meyer , Christopher Mutschler , Dominik Seuß , Andreas Maier , Daniel D. Scherer

Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this…

Quantum Physics · Physics 2014-06-19 Hussain Anwar , Benjamin J. Brown , Earl T. Campbell , Dan E. Browne

We study the performance of distance-three surface code layouts under realistic multi-parameter noise models. We first calculate their thresholds under depolarizing noise. We then compare a Pauli-twirl approximation of amplitude and phase…

Quantum Physics · Physics 2014-12-12 Yu Tomita , Krysta M. Svore

We give a broad generalisation of the mapping, originally due to Dennis, Kitaev, Landahl and Preskill, from quantum error correcting codes to statistical mechanical models. We show how the mapping can be extended to arbitrary stabiliser or…

Quantum Physics · Physics 2021-06-03 Christopher T. Chubb , Steven T. Flammia

Quantum error correction (QEC) is often implemented on hardware that experiences biased noise, where dephasing errors occur more frequently than other errors. This has motivated many recent efforts to develop bias-tailored QEC codes, such…

Quantum Physics · Physics 2026-05-28 Arianna Meinking , Julie Campos , Kenneth R. Brown

2D compass codes are a family of quantum error-correcting codes that contain the Bacon-Shor codes, the $X$-Shor and $Z$-Shor codes, and the rotated surface codes. Previous numerical results suggest that the surface code has a constant…

Quantum Physics · Physics 2025-02-13 Balint Pato , J. Wilson Staples , Kenneth R. Brown

We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter r which estimates the scale-up in the size of the circuit due…

Quantum Physics · Physics 2007-05-23 Krysta M. Svore , Barbara M. Terhal , David P. DiVincenzo

We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We…

Quantum Physics · Physics 2019-02-19 Kasper Duivenvoorden , Nikolas P. Breuckmann , Barbara M. Terhal