7 papers · 1 filter
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…
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…
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…
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Mathias Weiden, Justin Kalloor, John Kubiatowicz +2
Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optima…
Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis
Mathias Weiden, Justin Kalloor, John Kubiatowicz +1
Machine Learning with deep neural networks has transformed computational approaches to scientific and engineering problems. Central to many of these advancements are precisely tune…