activity
20222026
most citedWide Quantum Circuit Optimization with Topology Aware Synthesis

2 citations · 4 across the 11 of their papers we have counts for

collaborators

12 papers

quant-ph2026

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…

quant-ph2026

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…

cs.ET2026

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…

quant-ph2026

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…

quant-ph2025

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…

quant-ph2025

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…

quant-ph2025

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…

quant-ph2024

AC/DC: Automated Compilation for Dynamic Circuits

Siyuan Niu, Efekan Kokcu, Anupam Mitra +6

Dynamic quantum circuits incorporate mid-circuit measurements (MCMs) and feed-forward operations are crucial for manipulating quantum information. They have been broadly used in qu…

quant-ph2024★ 1 cited

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…

quant-ph2024

Quantum Hardware Roofline: Evaluating the Impact of Gate Expressivity on Quantum Processor Design

Justin Kalloor, Mathias Weiden, Ed Younis +3

The design space of current quantum computers is expansive with no obvious winning solution. This leaves practitioners with a clear question: "What is the optimal system configurat…

quant-ph2023★ 1 cited

Improving Quantum Circuit Synthesis with Machine Learning

Mathias Weiden, Ed Younis, Justin Kalloor +2

In the Noisy Intermediate Scale Quantum (NISQ) era, finding implementations of quantum algorithms that minimize the number of expensive and error prone multi-qubit gates is vital t…

quant-ph2022★ 2 cited

Wide Quantum Circuit Optimization with Topology Aware Synthesis

Mathias Weiden, Justin Kalloor, John Kubiatowicz +2

Unitary synthesis is an optimization technique that can achieve optimal multi-qubit gate counts while mapping quantum circuits to restrictive qubit topologies. Because synthesis al…