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

arXiv:2508.05523 · quant-ph · Submitted 2025-08-07 · Read on arXiv

quant-ph

Submitted: 2025-08-07

Updated: 2026-07-24

Terminology

• Benchmarking — 15× in this paper · explained in 3 episodes
• Accuracy — 14× in this paper · explained in 1 episode
• Fidelity — 14× in this paper · explained in 2 episodes
• Distillation — 11× in this paper · explained in 2 episodes
• Trace — 8× in this paper · explained in 2 episodes
• Quantum Circuits — 7× in this paper · explained in 2 episodes
• Verification — 6× in this paper · explained in 2 episodes
• Robustness — 4× in this paper · explained in 5 episodes
• Hilbert Space — 3× in this paper · explained in 2 episodes
• Trace Distance — 3× in this paper · explained in 3 episodes
• BQP — 2× in this paper · explained in 2 episodes
• Instantaneous Quantum Polynomial — 2× in this paper
• Non-Markovianity — 2× in this paper · explained in 3 episodes
• Temporal Correlations — 2× in this paper · explained in 2 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• CSS Codes — 1× in this paper · explained in 2 episodes
• Calibration — 1× in this paper · explained in 7 episodes
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• Hubbard Model — 1× in this paper · explained in 3 episodes
• No-Go Theorem — 1× in this paper · explained in 2 episodes
• Resource Constraints — 1× in this paper · explained in 3 episodes
• Sample Complexity — 1× in this paper · explained in 15 episodes

Sources

• Demonstration of logical qubits and repeated error correction with better-than-physical error rates
• Improved Accreditation of Analogue Quantum Simulation and Establishing Quantum Advantage
• Entropy Density Benchmarking of Near-Term Quantum Circuits
• Assessing requirements to scale to practical quantum advantage
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
• Concepts and conditions for error suppression through randomized compiling
• Non-Markovian Noise Suppression Simplified through Channel Representation

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity