9 citations · 14 across the 8 of their papers we have counts for
16 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…
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…
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…
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…
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…
Leveraging Quantum Machine Learning Generalization to Significantly Speed-up Quantum Compilation
Alon Kukliansky, Lukasz Cincio, Ed Younis +1
Existing numerical optimizers deployed in quantum compilers use expensive matrix-matrix operations. Inspired by recent advances in quantum machine learning (QML)…