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

Bulletin of the American Physical Society

Exponential suppression of bit or phase flip errors using repetition codes on superconducting qubits (Part I)

Sabrina Hong

Published Mar 15, 2021• 0 citations
OpenAlex

Related papers

Exponential suppression of bit or phase flip errors using repetition codes on superconducting qubits (Part II)

Zijun Chen

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Exponential suppression of bit-flips in a qubit encoded in an oscillator

Raphaël Lescanne, Marius Villiers, Théau Peronnin +6 more

arXiv:1907.11729•Nature Physics•Mar 16, 2020•320 citations

Cat-Qubit Phase-Flip Overhead: Trading an Exponential Bit-Flip Suppression for a Smaller Repetition Code

William Alexander Aldred

Bosonic cat qubits store information in superpositions of coherent states of a microwave cavity, and their error structure is radically lopsided: bit flips are suppressed exponentially in the mean photon number, while phase flips grow only linearly. At a mean photon number of eight the bit-flip suppression factor relative to the bare oscillator scale is of order 9e6, deep into territory where bit flips effectively vanish from the budget, leaving a nearly pure phase-flip channel that a simple repetition code, rather than a full two-dimensional surface code, can correct. This paper budgets the resulting overhead trade. The repetition code that remains is one-dimensional, its patches are ribbons rather than squares, and published analyses credit the architecture with order-of-magnitude savings in physical qubits per logical qubit at algorithmic quality. The paper prices the phase-flip side honestly: the linear growth of phase flips with photon number sets an optimum cat size, and the operations that preserve the bias are a restricted set whose restrictions reappear as compilation and factory costs elsewhere in the machine.

•Nov 15, 2026•0 citations

Quantum Codes for Simplifying Design and Suppressing Decoherence in Superconducting Phase-Qubits

Daniel A. Lidar, Lian-Ao Wu, Alexandre Blais

arXiv:cond-mat/0204153•Quantum Information Processing•Jun 1, 2002•14 citations

Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise

Peter Shanahan, Diego Ruiz

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 rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise, but they still face challenges. The rectangular surface code suffers from a relatively low threshold, while the XZZX code requires twice as many physical qubits to maintain the same code distance as the surface code. In this work, we introduce a 2D local code construction that outperforms these codes for noise biases $η\ge 7\times10^{4}$, reducing the qubit overhead by over 50% at $p_Z=10^{-3}$ and $η= 2 \times 10^6$ to achieve a logical error rate of $10^{-12}$. Our construction relies on the concatenation of two classical codes. The inner codes are repetition phase-flip codes while the outer codes are high-rate bit-flip codes enabled by their implementation at the logical level, which circumvents device connectivity constraints. These results indicate that under sufficiently biased noise, it is advantageous to address phase-flip and bit-flip errors at different layers of the coding scheme. The inner code should prioritize a high threshold for phase-flip errors, while the bit-flip outer code should optimize for encoding rate efficiency. In the strong biased-noise regime, high-rate outer codes keep the overhead for correcting residual bit-flip errors comparable to that of the repetition code itself, meaningfully lower than that required by earlier approaches.

quant-pharXiv:2601.10786•Jan 19, 2026•7 citations

Exponential suppression of bit or phase errors with cyclic error correction

Google Quantum AI, Zijun Chen, Kevin J. Satzinger +94 more

Abstract Realizing the potential of quantum computing requires sufficiently low logical error rates 1 . 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 correction 15–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 device 18,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.

arXiv:2102.06132•Nature•Jul 14, 2021•458 citations
Bosonic cat qubits store information in superpositions of coherent states of a microwave cavity, and their error structure is radically lopsided: bit flips are suppressed exponentially in the mean photon number, while phase flips grow only linearly. At a mean photon number of eight the bit-flip suppression factor relative to the bare oscillator scale is of order 9e6, deep into territory where bit flips effectively vanish from the budget, leaving a nearly pure phase-flip channel that a simple repetition code, rather than a full two-dimensional surface code, can correct. This paper budgets the resulting overhead trade. The repetition code that remains is one-dimensional, its patches are ribbons rather than squares, and published analyses credit the architecture with order-of-magnitude savings in physical qubits per logical qubit at algorithmic quality. The paper prices the phase-flip side honestly: the linear growth of phase flips with photon number sets an optimum cat size, and the operations that preserve the bias are a restricted set whose restrictions reappear as compilation and factory costs elsewhere in the machine.
Biased-noise qubits, in which one type of error (e.g. XXX- and YYY-type errors) is significantly suppressed relative to the other (e.g. ZZZ-type errors), can significantly reduce the overhead of quantum error correction. Codes such as the rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise, but they still face challenges. The rectangular surface code suffers from a relatively low threshold, while the XZZX code requires twice as many physical qubits to maintain the same code distance as the surface code. In this work, we introduce a 2D local code construction that outperforms these codes for noise biases η≥7×104η\ge 7\times10^{4}η≥7×104, reducing the qubit overhead by over 50% at pZ=10−3p_Z=10^{-3}pZ​=10−3 and η=2×106η= 2 \times 10^6η=2×106 to achieve a logical error rate of 10−1210^{-12}10−12. Our construction relies on the concatenation of two classical codes. The inner codes are repetition phase-flip codes while the outer codes are high-rate bit-flip codes enabled by their implementation at the logical level, which circumvents device connectivity constraints. These results indicate that under sufficiently biased noise, it is advantageous to address phase-flip and bit-flip errors at different layers of the coding scheme. The inner code should prioritize a high threshold for phase-flip errors, while the bit-flip outer code should optimize for encoding rate efficiency. In the strong biased-noise regime, high-rate outer codes keep the overhead for correcting residual bit-flip errors comparable to that of the repetition code itself, meaningfully lower than that required by earlier approaches.
Abstract Realizing the potential of quantum computing requires sufficiently low logical error rates 1 . 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 correction 15–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 device 18,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.