Effectiveness of the syndrome extraction circuit with flag qubits on IBM quantum hardware

Abstract

Large scale quantum circuits are required to exploit the advantages of quantum computers. Despite significant advancements in quantum hardware, scalability remains a challenge, with errors accumulating as more qubits and gates are added. To overcome this limitation, quantum error-correction codes have been introduced. Although the success of quantum error correction codes has been demonstrated on superconducting quantum processors and neutral atom-based systems, there have been no experimental reports of error suppression using flag qubits on a quantum processor. IBM's quantum hardware features a non-topological coupling map, and past developments of quantum error correction codes on this platform have primarily explored the use of flag qubits. Here, we report the successful implementation of a syndrome extraction circuit with flag qubits on IBM quantum computers. Moreover, we demonstrate its effectiveness by considering the repetition code as a test code among the quantum error-correcting codes. Even though the data qubit is not adjacent to the syndrome qubit, logical error rates diminish as the distance of the repetition code increases from three to nine. Even when two flag qubits exist between the data and syndrome qubits, the logical error rates decrease as the distance increases similarly. This confirms the successful implementation of the syndrome extraction circuit with flag qubits on the IBM quantum computer.

References in corpus (33)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Error Correction for Quantum Memories
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• Stabilizer Codes and Quantum Error Correction
• Efficient Z-Gates for Quantum Computing
• Characterizing Quantum Gates via Randomized Benchmarking
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Stim: a fast stabilizer circuit simulator
• Repeated Quantum Error Detection in a Surface Code
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Fault-tolerant operation of a logical qubit in a diamond quantum processor
• Quantum error correction with only two extra qubits
• Laser-annealing Josephson junctions for yielding scaled-up superconducting quantum processors
• Topological and subsystem codes on low-degree graphs with flag qubits
• Fast simulation of stabilizer circuits using a graph state representation
• Effective fault-tolerant quantum computation with slow measurements
• Reducing unitary and spectator errors in cross resonance with optimized rotary echoes
• Flag fault-tolerant error correction with arbitrary distance codes
• Fault-tolerant quantum computation with few qubits
• Encoding a magic state with beyond break-even fidelity
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
• Flag fault-tolerant error correction for any stabilizer code
• Calibrated decoders for experimental quantum error correction
• A repetition code of 15 qubits
• Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
• Creating entangled logical qubits in the heavy-hex lattice with topological codes
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
• Quantum computer error structure probed by quantum error correction syndrome measurements