activity
20242026
collaborators

6 papers

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…

quant-ph2026

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…

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

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-ph2025

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Aaron Szasz, Ed Younis, Wibe Albert de Jong

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art cla…

quant-ph2024

AC/DC: Automated Compilation for Dynamic Circuits

Siyuan Niu, Efekan Kokcu, Anupam Mitra +6

Dynamic quantum circuits incorporate mid-circuit measurements and feed-forward operations originally intended to realize Quantum Error Correction. This paradigm has recently been u…