102 citations · 245 across the 7 of their papers we have counts for
8 papers · 1 filter
Let Each Quantum Bit Choose Its Basis Gates
Sophia Fuhui Lin, Sara Sussman, Casey Duckering +5
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of ba…
Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates
Casey Duckering, Jonathan M. Baker, Andrew Litteken +1
Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succe…
Resource-Efficient Quantum Computing by Breaking Abstractions
Yunong Shi, Pranav Gokhale, Prakash Murali +11
Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an acce…
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…
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…
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…