CDCasey Duckering

Casey Duckering

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Casey Duckering has a total of 94 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers

    Low-overhead transversal fault tolerance for universal quantum computation

    by Hengyun Zhou, Chen Zhao, Madelyn Cain, Dolev Bluvstein, Nishad Maskara, Casey Duckering, Hong-Ye Hu, Sheng-Tao Wang, Aleksander Kubica, Mikhail D. Lukin

    Fast, reliable logical operations are essential for realizing useful quantum computers1,2,3. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, we can achieve low logical error rates. However, for many practical quantum error correction codes such as the surface code, owing to syndrome measurement errors, standard constructions require multiple extraction rounds—of the order of the code distance d—for fault-tolerant computation, particularly considering fault-tolerant state preparation4,5,6,7,8,9,10,11,12. Here we show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds for a broad class of quantum error correction codes, including the surface code with magic state inputs and feedforward, to achieve ‘transversal algorithmic fault tolerance’. Through the combination of transversal operations7 and new strategies for correlated decoding13, despite only having access to partial syndrome information, we prove that the deviation from the ideal logical measurement distribution can be made exponentially small in the distance, even if the instantaneous quantum state cannot be made close to a logical codeword because of measurement errors. We supplement this proof with circuit-level simulations in a range of relevant settings, demonstrating the fault tolerance and competitive performance of our approach. Our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space–time cost of practical fault-tolerant quantum computation by over an order of magnitude.


  • Top Cited Papers

    Experimental demonstration of logical magic state distillation

    by Pedro Sales Rodriguez, John M. Robinson, Paul Niklas Jepsen, Zhiyang He, Casey Duckering, Chen Zhao, Kai-Hsin Wu, Joseph Campo, Kevin Bagnall, Minho Kwon, et al.

    Realizing universal fault-tolerant quantum computation is a key goal in quantum information science [1, 2, 3, 4]. By encoding quantum information into logical qubits utilizing quantum error correcting codes, physical errors can be detected and corrected, enabling substantial reduction in logical error rates [5, 6, 7, 8, 9, 10, 11]. However, the set of logical operations that can be easily implemented on such encoded qubits is often constrained [12, 1], necessitating the use of special resource states known as ‘magic states’ [13] to implement universal, classically hard circuits [14]. A key method to prepare high-fidelity magic states is to perform ‘distillation’, creating them from multiple lower fidelity inputs [15, 13]. Here we present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer. Our approach makes use of a dynamically reconfigurable architecture [16, 8] to encode and perform quantum operations on many logical qubits in parallel. We demonstrate the distillation of magic states encoded in d = 3 and d = 5 color codes, observing improvements of the logical fidelity of the output magic states compared to the input logical magic states. These experiments demonstrate a key building block of universal fault-tolerant quantum computation, and represent an important step towards large-scale logical quantum processors.


  • Top Cited Papers
    Open Access

    Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays

    by Hengyun Zhou, Casey Duckering, Chen Zhao, Dolev Bluvstein, Madelyn Cain, Aleksander Kubica, Sheng-Tao Wang, Mikhail D. Lukin


  • Open Access

    Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates

    by Casey Duckering, Jonathan M. Baker, Andrew Litteken, Frederic T. 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.


  • Virtual Logical Qubits: A Compact Architecture for Fault-Tolerant Quantum Computing

    by Jonathan M. Baker, Casey Duckering, David I. Schuster, Frederic T. Chong

    Fault tolerant quantum computing is required to execute many of the most promising quantum applications. In recent years, numerous error correcting codes, like the surface code, have emerged which are well suited for current and future limited connectivity 2D devices. We find quantum memory, particularly resonant cavities with transmon qubits arranged in a 2.5D architecture, can efficiently implement surface codes with around 20x fewer transmons via this work. We virtualize 2D memory addresses by storing the code in layers of qubit memories connected to each transmon. Distributing logical qubits across many memories has minimal impact on fault tolerance and results in substantially more efficient logical operations. Virtualized Logical Qubit (VLQ) systems can achieve fault tolerance comparable to conventional 2D transmon-only architectures while putting within reach a proof-of-concept experimental demonstration of around 10 logical qubits, requiring only 11 transmons and 9 attached cavities.


  • Resource-Efficient Quantum Computing by Breaking Abstractions

    by Yunong Shi, Pranav Gokhale, Prakash Murali, Jonathan M. Baker, Casey Duckering, Yongshan Ding, Natalie C. Brown, Christopher Chamberland, Ali Javadi-Abhari, Andrew W. Cross, et al.

    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.


  • Open Access

    Extending the Frontier of Quantum Computers With Qutrits

    by Pranav Gokhale, Jonathan M. Baker, Casey Duckering, Frederic T. Chong, Natalie C. 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.


  • Open Access

    Efficient Quantum Circuit Decompositions via Intermediate Qudits

    by 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 resource-constrained for years to come so reducing ancilla requirements is crucial. In this work, we give a method to generate ancilla out of idle qubits by placing some in higher-value states, called qudits. We show how to take a circuit with many $O(n)$ ancilla and design an ancilla-free circuit with the same asymptotic depth. Using this, we give a circuit construction for an in-place adder and a constant adder both with $O(\log n)$ depth using temporary qudits and no ancilla.

  • Open Access

    Decomposing Quantum Generalized Toffoli with an Arbitrary Number of Ancilla

    by Jonathan M. Baker, Casey Duckering, Alexander Hoover, Frederic T. Chong

    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 shown how to decompose the Generalized Toffoli using 0, 1, or $O(n)$ many clean ancilla and 0, 1, and $n-2$ dirty ancilla, we provide a generalized algorithm to bridge the gap, i.e. this work gives an algorithm to generate a decomposition for any number of clean or dirty ancilla. While it is hard to guarantee optimality, our decompositions guarantee a decrease in circuit depth as the number of ancilla increases.