2 citations · 6 across the 12 of their papers we have counts for
5 papers · 1 filter
Approximate synthesis of general single-qubit unitaries over the Clifford+ gate set
Mathias Weiden, Jae Won Kim, Justin Kalloor +2
For the standard Clifford+ gate set, deterministic, ancilla-free synthesis now attains the minimal -count for general single-qubit unitaries (Morisaki et al., arXiv:2510.0581…
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…
Gradient-Based Optimization Enables Scalable Fault-Tolerant Quantum Gate Synthesis
Marc Grau Davis, Ed Younis, Mathias Weiden +2
We develop a numerical approach to optimizing a quantum circuit over a discrete gate set by using gradient descent to tune angles to a solution where many gates can be…
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…
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…