Fault Tolerance by Construction

• URL: http://arxiv.org/abs/2506.17181v2
• Date: Mon, 23 Jun 2025 17:59:00 GMT
• Title: Fault Tolerance by Construction
• Authors: Benjamin Rodatz, Boldizsár Poór, Aleks Kissinger,
• Abstract summary: Key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment.<n>We propose a framework for designing fault-tolerant quantum circuits that are correct by construction.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment, as traditional techniques often fail to account for the effect of noise on circuits. In this work, we propose a framework for designing fault-tolerant quantum circuits that are correct by construction. The framework starts with idealised specifications of fault-tolerant gadgets and refines them using provably sound basic transformations. To reason about manipulating circuits while preserving their error correction properties, we define fault equivalence; two circuits are considered fault-equivalent if all undetectable faults on one circuit have a corresponding fault on the other. This guarantees that the effect of undetectable faults on both circuits is the same. We argue that fault equivalence is a concept that is already implicitly present in the literature. Many problems, such as state preparation and syndrome extraction, can be naturally expressed as finding an implementable circuit that is fault-equivalent to an idealised specification. To utilize fault equivalence in a computationally tractable manner, we adapt the ZX calculus, a diagrammatic language for quantum computing. We restrict its rewrite system to not only preserve the underlying linear map but also fault equivalence, i.e. the circuit's behaviour under noise. Enabled by our framework, we verify, optimise and synthesise new and efficient circuits for syndrome extraction and cat state preparation. We anticipate that fault equivalence can capture and unify different approaches in fault-tolerant quantum computing, paving the way for an end-to-end circuit compilation framework.

Related papers

• 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)
• Deterministic Fault-Tolerant State Preparation for Near-Term Quantum Error Correction: Automatic Synthesis Using Boolean Satisfiability [4.2955091080396075]
  We focus on the problem of automatically synthesizing fault-tolerant circuits for a broad class of quantum codes.<n>We utilize methods based on techniques from classical circuit design, such as satisfiability solving.<n>We demonstrate the correct fault-tolerant behavior of the synthesized circuits using circuit-level noise simulations.
  arXiv  Detail & Related papers  (2025-01-09T19:06:01Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes [4.2955091080396075]
  We propose an automated approach for fault-tolerant state preparation circuits for arbitrary CSS codes.<n>We provide a general construction for non-deterministic state preparation circuits beyond distance 3.<n>The resulting methods are publicly available as part of the Munich Quantum Toolkit.
  arXiv  Detail & Related papers  (2024-08-21T18:00:01Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Measurement-free fault-tolerant quantum error correction in near-term devices [0.0]
  We provide a novel scheme to perform QEC cycles without the need of measuring qubits. We benchmark logical failure rates of the scheme in comparison to a flag-qubit based EC cycle. We outline how our scheme could be implemented in ion traps and with neutral atoms in a tweezer array.
  arXiv  Detail & Related papers  (2023-07-25T07:22:23Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Classical simulators as quantum error mitigators via circuit cutting [15.335377418439064]
  We introduce an error mitigation framework that mitigates errors in a quantum circuit using circuit cutting. Our technique involves cutting the circuit in such a way that we run the circuit that needs to be executed on the quantum hardware. We perform error mitigation qubit by qubit and then provide a way to combine the different probabilities from each of the individual qubit error mitigation runs.
  arXiv  Detail & Related papers  (2022-12-14T16:54:35Z)
• Fault-tolerant circuit synthesis for universal fault-tolerant quantum computing [0.0]
  We present a quantum circuit synthesis algorithm for implementing universal fault-tolerant quantum computing based on geometricd codes. We show how to synthesize the set of universal fault-tolerant protocols for $[[7,1,3]]$ Steane code and the syndrome measurement protocol of $[[23, 1, 7]]$ Golay code.
  arXiv  Detail & Related papers  (2022-06-06T15:43:36Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.