CircLS: Compiling Lattice Surgery to Physical Circuits with Dynamic Allocation

arXiv:2608.23819 · quant-ph · Submitted 2026-08-24 · Read on arXiv

quant-ph

Submitted: 2026-08-24

Updated: 2026-09-21

Code: https://github.com/John-YuehanZhang/CircLS

Terminology

• Benchmark — 15× in this paper · explained in 2 episodes
• Ablation — 6× in this paper · explained in 1 episode
• Decode — 3× in this paper · explained in 2 episodes
• Distillation — 3× in this paper · explained in 2 episodes
• Core — 2× in this paper · explained in 2 episodes
• Quantum Computing and Engineering — 2× in this paper
• Verification — 2× in this paper · explained in 2 episodes
• Ablation study — 1× in this paper · explained in 1 episode
• Adam — 1× in this paper · explained in 2 episodes
• Ancilla Qubits — 1× in this paper · explained in 1 episode
• Annual International Symposium on Computer Architecture — 1× in this paper
• Entanglement — 1× in this paper · explained in 3 episodes
• Entanglement Distillation — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Quantum Physics — 1× in this paper · explained in 10 episodes

Sources

• Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits
• Surface code compilation via edge-disjoint paths
• Assessing requirements to scale to practical quantum advantage
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Open Quantum Assembly Language
• LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
• Low overhead quantum computation using lattice surgery
• Error-corrected Hadamard gate simulated at the circuit level
• Cleaner magic states with hook injection
• Inplace Access to the Surface Code Y Basis
• Magic state cultivation: growing T states as cheap as CNOT gates
• Quantum error correction below the surface code threshold
• Stabilizer Codes and Quantum Error Correction
• Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
• Compilation Pipeline for Predicting Algorithmic Break-Even in an Early-Fault-Tolerant Surface Code Architecture
• PureMagic: A Dynamic Scheduler for Lattice Surgery
• Surface code quantum computing by lattice surgery
• The FLuid Allocation of Surface code Qubits (FLASQ) cost model for early fault-tolerant quantum algorithms
• SPARO: Surface-code Pauli-based Architectural Resource Optimization for Fault-tolerant Quantum Computing
• Surface code off-the-hook: diagonal syndrome-extraction scheduling

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