8 papers
Multi-Qubit Dyadic Phase Fixing for Fault-Tolerant Quantum Compilation
Justin Kalloor, Mathias Weiden, Ed Younis +2
Fault-tolerant quantum computing requires translating application-level quantum circuits into the Clifford+ gate set, where the gate is the dominant resource cost. Phase kic…
PureMagic: A Dynamic Scheduler for Lattice Surgery
Steven Hofmeyr, Mathias Weiden, Justin Kalloor +2
Fault-tolerant quantum computation on surface codes requires magic states for universal computation. Traditional distillation factories deliver magic states deterministically but c…
T Count as a Numerically Solvable Minimization Problem
Marc Grau Davis, Ed Younis, Mathias Weiden +2
We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization probl…
TopoLS: Lattice Surgery Compilation via Topological Program Transformations
Junyu Zhou, Yuhao Liu, Ethan Decker +5
Lattice surgery is a leading approach for implementing fault-tolerant logical operations in surface code quantum computing, but compiling efficient lattice surgery layouts remains…
AlphaSyndrome: Tackling the Syndrome Measurement Circuit Scheduling Problem for QEC Codes
Yuhao Liu, Shuohao Ping, Junyu Zhou +8
Quantum error correction (QEC) is essential for scalable quantum computing, yet repeated syndrome-measurement cycles dominate its spacetime and hardware cost. Although stabilizers…
Application Scale Quantum Circuit Compilation with Controlled Error
Justin Kalloor, Lucas Kovalsky, Mathias Weiden +4
Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competi…