Optimising Quantum Error Correction Using Morphing Circuits

• URL: http://arxiv.org/abs/2604.09797v1
• Date: Fri, 10 Apr 2026 18:19:25 GMT
• Title: Optimising Quantum Error Correction Using Morphing Circuits
• Abstract summary: We show how morphing circuits introduced in Refs. [1-3] provide a way of optimising syndrome extraction circuits and codes.<n>We discuss morphing circuits in code optimisation among Abelian two-block group algebra (2BGA) codes.<n>We show that alternating syndrome extraction circuits - executed with alternating time-reversed rounds - can be viewed as a two-round morphing circuit.
• Score: 0.05729426778193397
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error correction (QEC) codes are traditionally defined and searched for without specifying the manner in which its syndrome extraction circuits are executed using elementary gates and measurements. We show how morphing circuits introduced in Refs. [1-3] provide a way of optimising syndrome extraction circuits and codes directly in terms of connectivity, choice of two-qubit gate (ISWAP versus CNOT) and number of physical qubits. We discuss morphing circuits in code optimisation among Abelian two-block group algebra (2BGA) codes, handling boundaries for 2D codes, codes with single-shot properties, and improving performance in stability experiments against measurement and reset errors. We show that alternating syndrome extraction circuits - executed with alternating time-reversed rounds - can be viewed as a two-round morphing circuit whose fault-tolerant properties are computationally much easier to examine than non-alternating syndrome extraction circuits. Our methods find new codes and syndrome extraction circuits of practical interest, including Abelian 2BGA morphing circuits with better code parameters and connectivity than existing circuits. [1] Matt McEwen, Dave Bacon, and Craig Gidney. Relaxing hardware requirements for surface code circuits using time-dynamics. Quantum, 7:1172, 2023. [2] Craig Gidney and Cody Jones. New circuits and an open source decoder for the color code, 2023. [3] Mackenzie H. Shaw and Barbara M. Terhal. Lowering connectivity requirements for bivariate bicycle codes using morphing circuits.

Related papers

• Recovery Algorithm for Correlated Errors in Permutation-Invariant Quantum Codes [2.6097841018267616]
  Quantum Error Recovery (QER) uses knowledge of the error channel acting on a quantum system to find optimal recovery maps.<n>We propose a new PI code family called CAD codes with explicit examples on 4 and 9 qubits for global symmetric AD errors.<n>For the CAD4 code, which perfectly corrects 1 global symmetric AD error, the compiled recovery circuit consists of 10 system and system-ancilla gates.
  arXiv  Detail & Related papers  (2026-07-02T15:49:28Z)
• Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
  A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
  arXiv  Detail & Related papers  (2026-05-08T17:01:19Z)
• GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs [6.815406906400873]
  GreenPeas is a toolchain for the high-speed, just-in-time compilation of decoding hypergraphs.<n>We show how Stim's backtracking algorithm can be mapped efficiently onto massively parallel GPU architectures.<n>Our implementation achieves a greater than 10x average speedup over the Stim baseline across two of the leading fault-tolerant architectures.
  arXiv  Detail & Related papers  (2026-04-17T18:11:20Z)
• Entangling logical qubits without physical operations [32.39799715470528]
  We introduce phantom codes-quantum error-correcting codes that realize entangling gates between all logical qubits in a code block purely through relabelling of physical qubits during compilation.<n>Our work establishes phantom codes as a viable architectural route to fault-tolerant quantum computation with scalable benefits for workloads with dense local entangling structure.
  arXiv  Detail & Related papers  (2026-01-28T19:00:00Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes.<n>We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits [0.7980273012483661]
  We generalize a novel parity-check circuit design principle called morphing circuits.<n>We define a new family of BB codes whose parity check circuits require a qubit connectivity of degree five instead of six.<n> Logical input/output to an ancillary surface code is also possible in a biplanar layout.
  arXiv  Detail & Related papers  (2024-07-23T09:35:49Z)
• Reducing Quantum Error Correction Overhead with Versatile Flag-Sharing Syndrome Extraction Circuits [5.770351255180495]
  An efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements. We propose to design parallel flagged syndrome extraction with shared flag qubits for quantum stabilizer codes.
  arXiv  Detail & Related papers  (2024-06-30T06:35:48Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.