Parametric Proof-Carrying Compilation for Quantum Error-Correction
John Zhuoyang Ye, Jens Palsberg
Abstract
We present PC-QEC, a proof-carrying compilation framework for quantum error correction parameterized by both code distance and syndrome-extraction scheme. It covers all four schemes---Standard, Flag, Shor and Knill---with circuit-level distance guarantees for every legal code distance in each proved family under the declared error and readout contracts. The circuit-level model permits single-wire Pauli errors at every operation's qubit operands, capturing data errors, readout errors and ancilla errors that propagate into multi-qubit hook errors. For each family and scheme, supplied code-algebra and invariant proofs combine with proved scheme-specific propagation lemmas into a finite symbolic certificate whose size is independent of code distance. We demonstrate family-wide guarantees for five code families across all four schemes. For rotated Surface code, one Standard Scheme certificate proves a distance lower bound d for every odd d3 and checks in 214\,s on average. Lean 4 mechanizes the metatheory and exact circuit-level distances for canonical rotated Surface, unrotated Surface and Toric code families.
Create a lesson
Related papers
You Have Mail: Set-Theoretic Types for Actors
Giuseppe Castagna, Luca Padovani, Daniele Varacca et al.
Sightline: Calibrated Data-Flow Summaries for LLM-Integrated Applications
Zihao Xu, Yuekang Li, Ruitao Feng et al.
Tenon: A Unified Programming Framework for Retargetable PIM Compilation
Niansong Zhang, Shiran Guo, Zhiru Zhang
Mode Inference for Substructural Adjoint Types
Sophia Roshal, Frank Pfenning
A Principled Approach to Concurrency, Nondeterminism, and Asynchrony in Choreographies
Xueying Qin, Marco Peressotti, Fabrizio Montesi
Validating Concurrent Correctness Witnesses with Ghosts by Thread-Modular Abstract Interpretation
Michael Schwarz, Zhendong Ang, Umang Mathur