Logical accreditation: a framework for efficient certification of fault-tolerant computations
James Mills, Adithya Sireesh, Dominik Leichtle, Joschka Roffe, Elham Kashefi

TL;DR
Logical accreditation provides a scalable, noise-robust framework for certifying fault-tolerant quantum computations on logical qubits, enabling practical validation of quantum advantage and error mitigation effectiveness.
Contribution
It introduces a novel certification protocol for logical qubits that is robust against general noise and includes a new randomized compilation scheme for logical gates.
Findings
Scalable certification of quantum advantage experiments.
Logical accreditation bounds logical state infidelity.
Framework extends entropy benchmarking to fault-tolerant regimes.
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. The framework also enables evaluation of whether logical error rates are sufficiently low that error mitigation can be efficiently…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
