Logical accreditation: a framework for efficient certification of fault-tolerant computations

• URL: http://arxiv.org/abs/2508.05523v1
• Date: Thu, 07 Aug 2025 15:53:05 GMT
• Title: Logical accreditation: a framework for efficient certification of fault-tolerant computations
• Authors: James Mills, Adithya Sireesh, Dominik Leichtle, Joschka Roffe, Elham Kashefi,
• Abstract summary: We introduce logical accreditation, a framework for efficiently certifying quantum computations performed on logical qubits.<n>Our protocol is robust against general noise models, far beyond those typically considered in performance analyses of quantum error-correcting codes.
• Score: 1.1068280788997429
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As fault-tolerant quantum computers scale, certifying the accuracy of computations performed with encoded logical qubits will soon become classically intractable. This creates a critical need for scalable, device-independent certification methods. In this work, we introduce logical accreditation, a framework for efficiently certifying quantum computations performed on logical qubits. Our protocol is robust against general noise models, far beyond those typically considered in performance analyses of quantum error-correcting codes. Through numerical simulations, we demonstrate that logical accreditation can scalably certify quantum advantage experiments and indicate the crossover point where encoded computations begin to outperform physical computations. Logical accreditation can also find application in evaluating whether logical circuit error rates are sufficiently low that error mitigation can be efficiently performed, extending the entropy benchmarking method to the regime of fault-tolerant computation, and upper-bounding the infidelity of the logical output state. Underpinning the framework is a novel randomised compiling scheme that converts arbitrary logical circuit noise into stochastic Pauli noise. This scheme includes a method for twirling non-transversal logical gates beyond the standard T-gate, resolving an open problem posed by Piveteau et al. [Piveteau et al. PRL 127, 200505 (2001)]. By bridging fault-tolerant computation and computational certification, logical accreditation offers a practical tool to assess the quality of computations performed on quantum hardware using encoded logical qubits.

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)
• Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding [11.657137510701165]
  A crucial challenge of fault-tolerant quantum computing is reducing the overhead of implementing logical gates.<n>We propose an architecture that employs delayed fixup circuits and window-based correlated decoding.<n>This design significantly reduces both the frequency and duration of decoding, while maintaining support for constant-time and universal logical gates.
  arXiv  Detail & Related papers  (2024-10-22T12:44:41Z)
• Low-overhead fault-tolerant quantum computation by gauging logical operators [0.7673339435080445]
  Recent progress has uncovered quantum error-correcting codes with sparse connectivity requirements and constant qubit overhead. Existing schemes for fault-tolerant logical measurement do not always achieve low qubit overhead. We present a low-overhead method to implement fault-tolerant logical measurement in a quantum error-correcting code by treating the logical operator as a symmetry and gauging it.
  arXiv  Detail & Related papers  (2024-10-03T05:04:12Z)
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation [36.3664581543528]
  We show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds.<n>Our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space-time cost of practical fault-tolerant quantum computation by over an order of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43:25Z)
• 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)
• Strategies for practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers [1.3974342259149322]
  We describe the recent demonstration of a fault-tolerant universal gate set in a trapped-ion quantum computer. We show that various criteria to assess the break-even point for fault-tolerant quantum operations are within reach for the ion trap quantum computing architecture.
  arXiv  Detail & Related papers  (2023-01-24T14:01:48Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Relaxation times do not capture logical qubit dynamics [50.04886706729045]
  We show that spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits. This work will help to guide and benchmark experimental implementations of logical qubits.
  arXiv  Detail & Related papers  (2020-12-14T19:51:19Z)

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.