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

arXiv:2303.17810 · New Journal of Physics

Break-even point of the phase-flip error correcting code

Áron Rozgonyi, Gábor Széchenyi

Published Sep 20, 2023• 2 citations
arXivHTMLPDF

Abstract

Abstract In this theoretical study, we explore the use of quantum code-based memories to enhance the lifetime of qubits and exceed the break-even point, which is critical for the implementation of fault-tolerant quantum computing. Specifically, we investigate the quantum phase-flip repetition code as a quantum memory and theoretically demonstrate that it can preserve arbitrary quantum information longer than the lifetime of a single idle qubit in a dephasing-time-limited system, e.g. in semiconductor qubits. Our circuit-based analytical calculations show the efficiency of the phase-flip code as a quantum memory in the presence of relaxation, dephasing, and faulty quantum gates. Moreover, we identify the optimal repetition number of quantum error correction cycles required to reach the break-even point by considering the gate error probabilities of current platforms for quantum computing. Our results provide guidelines for developing quantum memories in semiconductor quantum devices.

DOI
10.1088/1367-2630/acfba5

Related papers

Phase flip code with semiconductor spin qubits

F. van Riggelen, William I. L. Lawrie, Maximilian Rimbach-Russ +6 more

Abstract The fault-tolerant operation of logical qubits is an important requirement for realizing a universal quantum computer. Spin qubits based on quantum dots have great potential to be scaled to large numbers because of their compatibility with standard semiconductor manufacturing. Here, we show that a quantum error correction code can be implemented using a four-qubit array in germanium. We demonstrate a resonant SWAP gate and by combining controlled-Z and controlled-S −1 gates we construct a Toffoli-like three-qubit gate. We execute a two-qubit phase flip code and find that we can preserve the state of the data qubit by applying a refocusing pulse to the ancilla qubit. In addition, we implement a phase flip code on three qubits, making use of a Toffoli-like gate for the final correction step. Both the quality and quantity of the qubits will require significant improvement to achieve fault-tolerance. However, the capability to implement quantum error correction codes enables co-design development of quantum hardware and software, where codes tailored to the properties of spin qubits and advances in fabrication and operation can now come together to advance semiconductor quantum technology.

arXiv:2202.11530•npj Quantum Information•Oct 27, 2022•47 citations

Hardware-efficient quantum error correction via concatenated bosonic qubits

Harald Putterman, Kyungjoo Noh, Connor T. Hann +97 more

To solve problems of practical importance1,2, quantum computers probably need to incorporate quantum error correction, in which a logical qubit is redundantly encoded in many noisy physical qubits3–5. The large physical-qubit overhead associated with error correction motivates the search for more hardware-efficient approaches6–18. Here, using a superconducting quantum circuit19, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits with an outer repetition code of distance d = 5 (ref. 10). A stabilizing circuit passively protects cat qubits against bit flips20–24. The repetition code, using ancilla transmons for syndrome measurement, corrects cat qubit phase flips. We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below the threshold. The logical bit-flip error is suppressed with increasing cat qubit mean photon number, enabled by our realization of a cat-transmon noise-biased CX gate. The minimum measured logical error per cycle is on average 1.75(2)% for the distance-3 code sections, and 1.65(3)% for the distance-5 code. Despite the increased number of fault locations of the distance-5 code, the high degree of noise bias preserved during error correction enables comparable performance. These results, where the intrinsic error suppression of the bosonic encodings enables us to use a hardware-efficient outer error-correcting code, indicate that concatenated bosonic codes can be a compelling model for reaching fault-tolerant quantum computation. Bosonic qubits can be engineered to feature intrinsic protection against certain kinds of errors, which makes quantum error correction across many bosonic qubits possible with less overhead.

arXiv:2409.13025•Nature•Feb 26, 2025•155 citations

Qubit Error Correction in Quantum Computing Simulations: Do Larger Repetition Codes Reduce Logical Errors?

Sanjeev Tamilselvan, Tanuj Ranjith

Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.

•Jun 12, 2026•0 citations

Implementation of the three-qubit phase-flip error correction code with superconducting qubits

Lars Tornberg, Margareta Wallquist, Göran Johansson +2 more

We investigate the performance of a three-qubit error correcting code in the framework of superconducting qubit implementations. Such a code can recover a quantum state perfectly in the case of dephasing errors but only in situations where the dephasing rate is low. Numerical studies in previous work have however shown that the code does increase the fidelity of the encoded state even in the presence of high error probability, during both storage and processing. In this work we give analytical expressions for the fidelity of such a code. We consider two specific schemes for qubit-qubit interaction realizable in superconducting systems; one ${\ensuremath{\sigma}}_{z}{\ensuremath{\sigma}}_{z}$ coupling and one cavity-mediated coupling. With these realizations in mind, and considering errors during storing as well as processing, we calculate the maximum operation time allowed in order to still benefit from the code. We show that this limit can be reached with current technology.

arXiv:0803.1747•Physical Review B•Jun 27, 2008•13 citations

Fault-Tolerant Heisenberg-Limited Quantum Sensing

Lorcan O. Conlon, Yu-Xin Wang, Erfan Abbasgholinejad +3 more

Quantum sensors hold great promise for achieving better sensitivity in the measurement of physical quantities compared to their classical counterparts. However, the conditions under which quantum advantage in sensing can be achieved are rather restrictive, and most quantum enhancements in sensing are lost in the presence of noise, errors, or a poorly calibrated system. To overcome these limitations, we are motivated to import ideas from fault-tolerant quantum computing to quantum sensing. Specifically, we consider a qubit noise model where the probability of phase-flip errors is exponentially smaller (in qubit number) compared to the probability of bit-flip errors that occur with probability $p$. For this noise structure, we demonstrate that, given a total sensing time $T$, Heisenberg scaling can be attained for times up to $T\propto 1/p^{(N+1)/2}$ for a $N$-qubit repetition code, in contrast with $T\propto 1/p$ without using a fault-tolerant sensing protocol.

quant-pharXiv:2608.00171•Aug 4, 2026•5 citations

Qubit Error Correction in Quantum Computing Simulations: Do Larger Repetition Codes Reduce Logical Errors?

Sanjeev Tamilselvan, Tanuj Ranjith

Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.

•Mar 31, 2026•0 citations
Abstract In this theoretical study, we explore the use of quantum code-based memories to enhance the lifetime of qubits and exceed the break-even point, which is critical for the implementation of fault-tolerant quantum computing. Specifically, we investigate the quantum phase-flip repetition code as a quantum memory and theoretically demonstrate that it can preserve arbitrary quantum information longer than the lifetime of a single idle qubit in a dephasing-time-limited system, e.g. in semiconductor qubits. Our circuit-based analytical calculations show the efficiency of the phase-flip code as a quantum memory in the presence of relaxation, dephasing, and faulty quantum gates. Moreover, we identify the optimal repetition number of quantum error correction cycles required to reach the break-even point by considering the gate error probabilities of current platforms for quantum computing. Our results provide guidelines for developing quantum memories in semiconductor quantum devices.
Abstract The fault-tolerant operation of logical qubits is an important requirement for realizing a universal quantum computer. Spin qubits based on quantum dots have great potential to be scaled to large numbers because of their compatibility with standard semiconductor manufacturing. Here, we show that a quantum error correction code can be implemented using a four-qubit array in germanium. We demonstrate a resonant SWAP gate and by combining controlled-Z and controlled-S −1 gates we construct a Toffoli-like three-qubit gate. We execute a two-qubit phase flip code and find that we can preserve the state of the data qubit by applying a refocusing pulse to the ancilla qubit. In addition, we implement a phase flip code on three qubits, making use of a Toffoli-like gate for the final correction step. Both the quality and quantity of the qubits will require significant improvement to achieve fault-tolerance. However, the capability to implement quantum error correction codes enables co-design development of quantum hardware and software, where codes tailored to the properties of spin qubits and advances in fabrication and operation can now come together to advance semiconductor quantum technology.
To solve problems of practical importance1,2, quantum computers probably need to incorporate quantum error correction, in which a logical qubit is redundantly encoded in many noisy physical qubits3–5. The large physical-qubit overhead associated with error correction motivates the search for more hardware-efficient approaches6–18. Here, using a superconducting quantum circuit19, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits with an outer repetition code of distance d = 5 (ref. 10). A stabilizing circuit passively protects cat qubits against bit flips20–24. The repetition code, using ancilla transmons for syndrome measurement, corrects cat qubit phase flips. We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below the threshold. The logical bit-flip error is suppressed with increasing cat qubit mean photon number, enabled by our realization of a cat-transmon noise-biased CX gate. The minimum measured logical error per cycle is on average 1.75(2)% for the distance-3 code sections, and 1.65(3)% for the distance-5 code. Despite the increased number of fault locations of the distance-5 code, the high degree of noise bias preserved during error correction enables comparable performance. These results, where the intrinsic error suppression of the bosonic encodings enables us to use a hardware-efficient outer error-correcting code, indicate that concatenated bosonic codes can be a compelling model for reaching fault-tolerant quantum computation. Bosonic qubits can be engineered to feature intrinsic protection against certain kinds of errors, which makes quantum error correction across many bosonic qubits possible with less overhead.
Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.
We investigate the performance of a three-qubit error correcting code in the framework of superconducting qubit implementations. Such a code can recover a quantum state perfectly in the case of dephasing errors but only in situations where the dephasing rate is low. Numerical studies in previous work have however shown that the code does increase the fidelity of the encoded state even in the presence of high error probability, during both storage and processing. In this work we give analytical expressions for the fidelity of such a code. We consider two specific schemes for qubit-qubit interaction realizable in superconducting systems; one ${\ensuremath{\sigma}}_{z}{\ensuremath{\sigma}}_{z}$ coupling and one cavity-mediated coupling. With these realizations in mind, and considering errors during storing as well as processing, we calculate the maximum operation time allowed in order to still benefit from the code. We show that this limit can be reached with current technology.
Quantum sensors hold great promise for achieving better sensitivity in the measurement of physical quantities compared to their classical counterparts. However, the conditions under which quantum advantage in sensing can be achieved are rather restrictive, and most quantum enhancements in sensing are lost in the presence of noise, errors, or a poorly calibrated system. To overcome these limitations, we are motivated to import ideas from fault-tolerant quantum computing to quantum sensing. Specifically, we consider a qubit noise model where the probability of phase-flip errors is exponentially smaller (in qubit number) compared to the probability of bit-flip errors that occur with probability ppp. For this noise structure, we demonstrate that, given a total sensing time TTT, Heisenberg scaling can be attained for times up to T∝1/p(N+1)/2T\propto 1/p^{(N+1)/2}T∝1/p(N+1)/2 for a NNN-qubit repetition code, in contrast with T∝1/pT\propto 1/pT∝1/p without using a fault-tolerant sensing protocol.
Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.