Casey Duckering's research while affiliated with University of Chicago and other places
What is this page?
This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
Publications (21)
The field of quantum computing is at an exciting time where we are constructing novel hardware, evaluating algorithms, and finding out what works best. As qubit technology grows and matures, we need to be ready to design and program larger quantum computer systems. An important aspect of systems design is layered abstractions to reduce complexity a...
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 basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) gates that can be implemented in a given technology. 2Q entangling gates, coupled with some 1Q gates, allow...
Quantum technologies currently struggle to scale beyond moderate scale prototypes and are unable to execute even reasonably sized programs due to prohibitive gate error rates or coherence times. Many software approaches rely on heavy compiler optimization to squeeze extra value from noisy machines but are fundamentally limited by hardware. Alone, t...
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 arran...
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 compil...
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 applications that might save years of engineering effort. Current quantum software stacks follow a layered ap...
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu trits . Past work with qutrits has demonstrated only constant factor improvements, owing to the log 2 (3) binary-to-ternary compression factor. We present a novel technique, intermediate qutrits, to achieve sublinear...
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 will need to transition to greater reliability through error correction, likely through promising techniques such as surface codes which are well suited for near-term devic...
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 layer...
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 quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning...
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...
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...
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qutrits. 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 (ru...
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\log_2(3)$ binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic dep...
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 t...
Citations
... This relation has been previously studied for theoretically inferring universal [25] and optimal [26,27] gate sets for QC or for pragmatically optimizing quantum compilation using native gate sets of specific QPU [28,29,30] in a general-purpose QC formulation. As presented in this article, the YAQQ approach deviates from previous approaches in three aspects. ...
... Quantum optimization techniques can be categorized as (1) qubit mapping and routing [6,44,50,51,58,61,81,86,88,93,96,98], (2) instruction/pulse scheduling [15,26,52,78,82,91,97], (3) gate synthesis/decomposition [14,46,58,62,78,79,95], (4) execution post-processing and readout improvement [11,13,16,48,59,60,87], and (5) circuit compaction [4,7,9,20,34,49,54,55,63,85]. These techniques are implemented standalone without a compiler infrastructure and, thus, are not composable. ...
Reference: QOS: A Quantum Operating System
... The main reason for the difficulty is the need to decompose all three-qubit gates into one-and twoqubit gates that are natively supported on the given platform. The most efficient decomposition of the Toffoli gate over linearly connected qubits requires eight twoqubit gates [35,36], each of which carry small but nonnegligible error. Meanwhile, it has been shown that the required number of entangling gates is significantly reduced when qudits are utilized in the decomposition [8-10, 13, 15, 26, 34, 37], giving a strong motivation for the research of robust qutrit control technologies. ...
... XQSim [14] is a full-system FTQC simulator. Stein et al. [51] proposed a heterogeneous architecture for FTQC, virtual logical qubits were proposed in [3], Lin et al. [35] explored modular architectures for error-correcting codes and scheduling for distillation factories was proposed in [22]. [32] described a blueprint of a fault-tolerant quantum computer. ...
... Recent advancements highlight the substantial advantages of deconstructing gate-level circuits into lower layers, specifically pulses responsible for controlling qubits in quantum computers. Defining circuits using low-level control pulses proves advantageous for tasks such as quantum circuit decomposition, compilation, and optimization [14], [15], [16], [17], [18], [19], as well as enhancing the expressivity and efficiency of quantum circuits [20], [21], [22], [23]. Despite the many benefits of specifying quantum circuits using lower-level control pulses, security and privacy have seldom been touched on. ...
Reference: Jailbreaking Quantum Computers
... The CHECKERBOARD architecture improves over the lattice surgery-based planar architecture by allocating more logical data qubits, thereby reducing the steps required to perform CNOT gates, and increasing the number of neighbors. Furthermore, Duckering et al. [38] proposed a 2.5D architecture that uses resonant cavities with transom qubit technology in a CHECKERBOARD architecture. This design enables faster transversal application of CNOT operations and substantial hardware savings; however, it incurs a ten times penalty in serialization, and it requires cavity-based hardware technology. ...
... Recent advancements highlight the substantial advantages of deconstructing gate-level circuits into lower layers, specifically pulses responsible for controlling qubits in quantum computers. Defining circuits using low-level control pulses proves advantageous for tasks such as quantum circuit decomposition, compilation, and optimization [14], [15], [16], [17], [18], [19], as well as enhancing the expressivity and efficiency of quantum circuits [20], [21], [22], [23]. Despite the many benefits of specifying quantum circuits using lower-level control pulses, security and privacy have seldom been touched on. ...
Reference: Jailbreaking Quantum Computers
![[object Object]](https://i1.rgstatic.net/ii/profile.image/961855627472919-1606335660491_Q64/Pranav-Gokhale-3.jpg)
![[object Object]](https://i1.rgstatic.net/ii/profile.image/758549466595328-1557863694522_Q64/Natalie-Brown-38.jpg)
... A topical focus in QC is on engineering sufficiently robust quantum processors to demonstrate these computational benefits in practice, which has proved more difficult than anticipated [4,5,6], leading to the idea of noisy intermediate-scale quantum (NISQ) systems [7] as a stepping stone to large-scale fault-tolerant quantum computation (FTQC). NISQ-era solutions focus on various tailored approaches [8] to extract benefits from these limited computational devices. These approaches include aspects at various layers of the QC stack [9], for e.g., pulse control [10], parametric quantum circuits and architecture search [11], error mitigation [12] and correction [13], circuit knitting on distributed architectures [14], quantum circuit mapping and routing [15]. ...
![[object Object]](https://i1.rgstatic.net/ii/profile.image/1081675375226881-1634902914716_Q64/Prakash-Murali-2.jpg)
... Many methods have been proposed to address the mapping problem in single core architectures. Qubit allocation on multi-core and modular architectures has recently gained attention and few mapping strategies have been proposed [4], [5], [17], [18], [53]. ...
... In [13], the authors proposed temporary usage of |2 , a higher-dimensional state within a qubit system, and showed an exponential reduction in the depth of the decomposition circuit for a Toffoli gate without any ancilla qubits. This has triggered studies on potential applications of temporary usage of |2 within a qubit system. ...
