Flow-Based Lattice Surgery Optimization with Runtime T Gate Scheduling

arXiv:2609.23756 · quant-ph · Submitted 2026-09-20 · Read on arXiv

quant-ph

Submitted: 2026-09-20

Updated: 2026-09-20

Terminology

• Benchmark — 27× in this paper · explained in 2 episodes
• Distillation — 7× in this paper · explained in 2 episodes
• Active Volume — 4× in this paper · explained in 1 episode
• Core — 4× in this paper · explained in 2 episodes
• Post-Selection — 4× in this paper · explained in 2 episodes
• Fidelity — 3× in this paper · explained in 2 episodes
• Ablation — 2× in this paper · explained in 1 episode
• Abstraction — 1× in this paper · explained in 1 episode
• Ancilla Qubits — 1× in this paper · explained in 1 episode
• Benchmarking — 1× in this paper · explained in 3 episodes
• Embeddings — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Structural Constraints — 1× in this paper · explained in 2 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Flexible layout of surface code computations using AutoCCZ states
• Magic state cultivation: growing T states as cheap as CNOT gates
• Compilation Pipeline for Predicting Algorithmic Break-Even in an Early-Fault-Tolerant Surface Code Architecture
• FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture
• PureMagic: A Dynamic Scheduler for Lattice Surgery
• The FLuid Allocation of Surface code Qubits (FLASQ) cost model for early fault-tolerant quantum algorithms
• Linear-Time T-Gate Optimization via Random Abstraction
• Low overhead quantum computation using lattice surgery
• SPARO: Surface-code Pauli-based Architectural Resource Optimization for Fault-tolerant Quantum Computing
• Reducing Postselection Overhead in Magic-State Cultivation by In-Patch Multiplexing
• Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings
• Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections
• ZX-calculus for the working quantum computer scientist
• CircLS: Compiling Lattice Surgery to Physical Circuits with Dynamic Allocation
• TopoLS: Lattice Surgery Compilation via Topological Program Transformations
• LightSABRE: A Lightweight and Enhanced SABRE Algorithm

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