Efficient Estimation of Logical Sensitivities Through Fault-Counting

arXiv:2610.10531 · quant-ph · Submitted 2026-10-07 · Read on arXiv

quant-ph

Submitted: 2026-10-07

Updated: 2026-10-07

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Trace — 4× in this paper · explained in 2 episodes
• Score Function — 3× in this paper · explained in 4 episodes
• Higher-order derivatives — 2× in this paper · explained in 2 episodes
• Model-Agnostic — 2× in this paper · explained in 2 episodes
• Reinforcement Learning — 2× in this paper · explained in 4 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Aggregation — 1× in this paper
• Ancilla Qubits — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Iterative Refinement — 1× in this paper · explained in 3 episodes

Sources

• Subsystem surface and compass code sensitivities to non-identical infidelity distributions on heavy-hex lattice
• Heterogeneous quantum error-correcting codes
• Low-valency scalable quantum error correction with a dynamic compass code
• Tesseract: A Search-Based Decoder for Quantum Error Correction
• Non-Clifford Crosstalk Noise in Surface Codes Using Hybrid Stabilizer-Tensor Network Methods
• Polynomial-time simulation of non-Clifford quantum error correction
• Optimizing quantum error correction through error attribution

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
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians