Casey Duckering

Casey Duckering

Auto-generated profile, based on publicly available information

Casey Duckering

QuEra Computing, Boston, US

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 July 2025 in Nature
Verified
Journal Article
Closed access
PDF file
PRPedro Sales Rodriguez
Pedro Sales Rodriguez
JRJohn M. Robinson
John M. Robinson
PJPaul Niklas Jepsen
Paul Niklas Jepsen
ZHZhiyang He
Zhiyang He
CDCasey Duckering
Casey Duckering
SCSergio H. Cantú
Sergio H. Cantú

24 September 2025 in Nature
Verified
Journal Article
Closed access
PDF file
HZHengyun Zhou
Hengyun Zhou
CZChen Zhao
Chen Zhao
MCMadelyn Cain
Madelyn Cain
DBDolev Bluvstein
Dolev Bluvstein
NMNishad Maskara
Nishad Maskara
MLMikhail D. Lukin
Mikhail D. Lukin

15 June 2020 in Proceedings of the IEEE
Verified
Journal Article
Closed access
YSYunong Shi
Yunong Shi
PGPranav Gokhale
Pranav Gokhale
PMPrakash Murali
Prakash Murali
JBJonathan M. Baker
Jonathan M. Baker
CDCasey Duckering
Casey Duckering
FCFred Chong
Fred Chong
Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an accelerated pathway to the first generation of quantum computing (QC) applications that might save years of engineering effort. Current quantum software stacks follow a layered approach similar to the stack of classical computers, which was designed to manage the complexity. In this review, we point out that greater efficiency of QC systems can be achieved by breaking the abstractions between these layers. We review several works along this line, including two hardware-aware compilation optimizations that break the quantum instruction set architecture (ISA) abstraction and two error-correction/information-processing schemes that break the qubit abstraction. Last, we discuss several possible future directions.

16 April 2020 in IEEE Micro
Verified
Journal Article
Open access
PGPranav Gokhale
Pranav Gokhale
JBJonathan M. Baker
Jonathan M. Baker
CDCasey Duckering
Casey Duckering
FCFred Chong
Fred Chong
NBNatalie C. Brown
Natalie C. Brown
KBKenneth R. Brown
Kenneth R. Brown
We advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log2(3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla—an exponential improvement over linear depth for the best qubit-only equivalent. Our approach also features a 70x improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms like for arithmetic and QRAM. Our simulator accounts for the cost of operating qutrits with realistic near-term noise models. Simulation results for these noise models indicate over 90% mean reliability (fidelity) for our circuit construction, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path towards extending the frontier of quantum computers.

17 April 2021
Verified
Conference Paper
Open access
CDCasey Duckering
Casey Duckering
JBJonathan M. Baker
Jonathan M. Baker
ALAndrew Litteken
Andrew Litteken
FCFred Chong
Fred Chong
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 succeed. These computers only support operations decomposed into one- and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates. This significantly reduces communication overhead by giving the routing pass access to the higher-level structure of the circuit instead of discarding it. A second benefit is the ability to now select an architecture-tuned Toffoli decomposition such as the 8-CNOT Toffoli for the specific hardware qubits now known after the routing pass. We perform real experiments on IBM Johannesburg showing an average 35% decrease in two-qubit gate count and 23% increase in success rate of a single Toffoli over Qiskit. We additionally compile many near-term benchmark algorithms showing an average 344% increase in (or 4.44x) simulated success rate on the Johannesburg architecture and compare with other architecture types.

20 June 2025
Verified
Conference Paper
Open access
HZHengyun Zhou
Hengyun Zhou
CDCasey Duckering
Casey Duckering
CZChen Zhao
Chen Zhao
DBDolev Bluvstein
Dolev Bluvstein
MCMadelyn Cain
Madelyn Cain
MLMikhail D. Lukin
Mikhail D. Lukin