most citedAsymptotic Improvements to Quantum Circuits via Qutrits

102 citations · 186 across the 4 of their papers we have counts for

collaborators

5 papers

quant-ph20203 cited

Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing

Casey Duckering, Jonathan M. Baker, David I. Schuster +1

Current, near-term quantum devices have shown great progress in recent years culminating with a demonstration of quantum supremacy. In the medium-term, however, quantum machines wi…

quant-ph202071 cited

Time-Sliced Quantum Circuit Partitioning for Modular Architectures

Jonathan M. Baker, Casey Duckering, Alexander Hoover +1

Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected qua…

quant-ph2020

Efficient Quantum Circuit Decompositions via Intermediate Qudits

Jonathan M. Baker, Casey Duckering, Frederic T. Chong

Many quantum algorithms make use of ancilla, additional qubits used to store temporary information during computation, to reduce the total execution time. Quantum computers will be…

quant-ph2019102 cited

Asymptotic Improvements to Quantum Circuits via Qutrits

Pranav Gokhale, Jonathan M. Baker, Casey Duckering +3

Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu. Past work with qutrits has demonstrated…

quant-ph201910 cited

Decomposing Quantum Generalized Toffoli with an Arbitrary Number of Ancilla

Jonathan M. Baker, Casey Duckering, Alexander Hoover +1

We present a general decomposition of the Generalized Toffoli, and for completeness, the multi-target gate using an arbitrary number of clean or dirty ancilla. While prior work has…