Break-even point of the quantum repetition code
arXiv:2303.17810 · doi:10.1088/1367-2630/acfba5
Abstract
Enhancing the lifetime of qubits with quantum code-based memories on different quantum hardware is a significant step towards fault-tolerant quantum computing. We theoretically show that the break-even point, i.e., preserving arbitrary quantum information longer than the lifetime of a single idle qubit, can be beaten even with the quantum phase-flip repetition code in a dephasing-time-limited system. Applying circuit-based analytical calculation, we determine the efficiency of the phase-flip code as a quantum memory in the presence of relaxation, dephasing, and faulty quantum gates. Considering current platforms for quantum computing, we identify the gate error probabilities and optimal repetition number of quantum error correction cycles to reach the break-even point.
9 pages, 4 figures
References in corpus (9)
- The Quantum Internet
- Surface codes: Towards practical large-scale quantum computation
- Suppressing quantum errors by scaling a surface code logical qubit
- Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Low-distance Surface Codes under Realistic Quantum Noise
- Detecting bit-flip errors in a logical qubit using stabilizer measurements
- Beating the break-even point with a discrete-variable-encoded logical qubit
- Surface code with decoherence: An analysis of three superconducting architectures