An official website of the United States government
The control of cryogenic qubits in today’s super-conducting quantum computer prototypes presents significant scalability challenges due to the massive costs of generating/routing the analog control signals that need to be sent from a classical controller at room temperature to the quantum chip inside the dilution refrigerator. Thus, researchers in industry and academia have focused on designing in-fridge classical controllers in order to mitigate these challenges. Due to the maturity of CMOS logic, many industrial efforts (Microsoft, Intel) have focused on Cryo-CMOS as a near-term solution to design in-fridge classical controllers. Meanwhile, Supercon-ducting Single Flux Quantum (SFQ) is an alternative, less mature classical logic family proposed for large-scale in-fridge controllers. SFQ logic has the potential to maximize scalability thanks to its ultra-high speed and very low power consumption. However, architecture design for SFQ logic poses challenges due to its unconventional pulse-driven nature and lack of dense memory and logic. Thus, research at the architecture level is essential to guide architects to design SFQ-based classical controllers for large-scale quantum machines.In this paper, we present DigiQ, the first system-level design of a Noisy Intermediate Scale Quantum (NISQ)-friendly SFQ-based classical controller. We perform a design space exploration of SFQ-based controllers and co-design the quantum gate decompositions and SFQ-based implementation of those decompositions to find an optimal SFQ-friendly design point that trades area and power for latency and control while ensuring good quantum algorithmic performance. Our co-design results in a single instruction, multiple data (SIMD) controller architecture, which has high scalability, but imposes new challenges on the calibration of control pulses. We present software-level solutions to address these challenges, which if unaddressed would degrade quantum circuit fidelity given the imperfections of qubit hardware.To validate and characterize DigiQ, we first implement it using hardware description languages and synthesize it using state-of-the-art/validated SFQ synthesis tools. Our synthesis results show that DigiQ can operate within the tight power and area budget of dilution refrigerators at >42,000-qubit scales. Second, we confirm the effectiveness of DigiQ in running quantum algorithms by modeling the execution time and fidelity of a variety of NISQ applications. We hope that the promising results of this paper motivate experimentalists to further explore SFQ-based quantum controllers to realize large-scale quantum machines with maximized scalability.
more »
« less
Quantum Control Machine: The Limits of Control Flow in Quantum Programming
Quantum algorithms for tasks such as factorization, search, and simulation rely on control flow such as branching and iteration that depends on the value of data in superposition. High-level programming abstractions for control flow, such as switches, loops, higher-order functions, and continuations, are ubiquitous in classical languages. By contrast, many quantum languages do not provide high-level abstractions for control flow in superposition, and instead require the use of hardware-level logic gates to implement such control flow. The reason for this gap is that whereas a classical computer supports control flow abstractions using a program counter that can depend on data, the typical architecture of a quantum computer does not analogously provide a program counter that can depend on data in superposition. As a result, the complete set of control flow abstractions that can be correctly realized on a quantum computer has not yet been established. In this work, we provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer. First, we prove that even on a quantum computer whose program counter exists in superposition, one cannot correctly realize control flow in quantum algorithms by lifting the classical conditional jump instruction to work in superposition. This theorem denies the ability to directly lift general abstractions for control flow such as the λ-calculus from classical to quantum programming. In response, we present the necessary and sufficient conditions for control flow to be correctly realizable on a quantum computer. We introduce the quantum control machine, an instruction set architecture featuring a conditional jump that is restricted to satisfy these conditions. We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.
more »
« less
- Award ID(s):
- 1751011
- PAR ID:
- 10553922
- Publisher / Repository:
- ACM
- Date Published:
- Journal Name:
- Proceedings of the ACM on Programming Languages
- Volume:
- 8
- Issue:
- OOPSLA1
- ISSN:
- 2475-1421
- Page Range / eLocation ID:
- 1 to 28
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Quantum computing utilizes superposition and entanglement to surpass classical computer capabilities. Central to this are qubits and their use to realize parallel quantum algorithms through circuits of simple one or two qubit gates. Controlling and measuring quantum systems is challenging. Here, we introduce a paradigm utilizing logical phi-bits, classical analogues of qubits using nonlinear acoustic waves, supported by an externally driven acoustic metastructure. These phi-bits bridge a low-dimensional linearly scaling physical space to a high-dimensional exponentially scaling Hilbert space in which parallel processing of information can be realized in the form of unitary operations. Here, we show the implementation of a nontrivial three-phi-bit unitary operation analogous to a quantum circuit but achieved via a single action on the metastructure, whereby the qubit-based equivalent requires sequences of qubit gates. A phi-bit-based approach might offer advantages over quantum systems, especially in tasks requiring large complex unitary operations. This breakthrough hints at a fascinating intersection of classical and quantum worlds, potentially redefining computational paradigms by harnessing nonlinear classical mechanical systems in quantum-analogous manners, blending the best of both domains.more » « less
-
Aldrich, Jonathan; Salvaneschi, Guido (Ed.)Because of the probabilistic/nondeterministic behavior of quantum programs, it is highly advisable to verify them formally to ensure that they correctly implement their specifications. Formal verification, however, also traditionally requires significant effort. To address this challenge, we present Qafny, an automated proof system based on the program verifier Dafny and designed for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations modeled within a classical separation logic framework. We prove the soundness and completeness of our proof system and implement a prototype compiler that transforms Qafny programs and specifications into Dafny for automated verification purposes. We then illustrate the utility of Qafny’s automated capabilities in efficiently verifying important quantum algorithms, including quantum-walk algorithms, Grover’s algorithm, and Shor’s algorithm.more » « less
-
Abstract Single-qubit gates are essential components of a universal quantum computer. Without selective addressing of individual qubits, scalable implementation of quantum algorithms is extremely challenging. When the qubits are discrete points or regions on a lattice, selectively addressing magnetic spin qubits at the nanoscale remains a challenge due to the difficulty of localizing and confining a classical divergence-free field to a small volume of space. Herein we propose a technique for addressing spin qubits using voltage-control of nanoscale magnetism, exemplified by the use of voltage control of magnetic anisotropy. We show that by tuning the frequency of the nanomagnet’s electric field drive to the Larmor frequency of the spins confined to a nanoscale volume, and by modulating the phase of the drive, single-qubit quantum gates with fidelities approaching those for fault-tolerant quantum computing can be implemented. Such single-qubit gate operations require only tens of femto-Joules per gate operation and have lossless, purely magnetic field control. Their physical realization is also straightforward using foundry manufacturing techniques.more » « less
-
[This paper is part of the Focused Collection in Investigating and Improving Quantum Education through Research.] Quantum information science and engineering (QISE) is a rapidly developing field that leverages the skills of experts from many disciplines to utilize the potential of quantum systems in a variety of applications. It requires talent from a wide variety of traditional fields, including physics, engineering, chemistry, and computer science, to name a few. To prepare students for such opportunities, it is important to give them a strong foundation in the basics of QISE, in which quantum computing plays a central role. In this study, we discuss the development, validation, and evaluation of a Quantum Interactive Learning Tutorial, on the basics and applications of quantum computing. These include an overview of key quantum mechanical concepts relevant to quantum computation (including ways a quantum computer is different from a classical computer), properties of single- and multiqubit systems, and the basics of single-qubit quantum gates. The tutorial uses guided inquiry-based teaching-learning sequences. Its development and validation involved conducting cognitive task analysis from both expert and student perspectives and using common student difficulties as a guide. For example, before engaging with the tutorial, after traditional lecture-based instruction, one reasoning primitive that was common in student responses is that a major difference between an -bit classical and -qubit quantum computer is that various things associated with a number for a classical computer should be replaced with the number for a quantum computer (e.g., qubits must be initialized and bits of information are obtained as the output of the computation on the quantum computer). This type of reasoning primitive also led many students to incorrectly think that there are only distinctly different states available when computation takes place on a classical computer. Research suggests that this type of reasoning primitive has its origins in students learning that quantum computers can provide exponential advantage for certain problems, e.g., Shor’s algorithm for factoring products of large prime numbers, and that the quantum state during the computation can be in a superposition of linearly independent states. The inquiry-based learning sequences in the tutorial provide scaffolding support to help students develop a functional understanding. The final version of the validated tutorial was implemented in two distinct courses offered by the physics department with slightly different student populations and broader course goals. Students’ understanding was evaluated after traditional lecture-based instruction on the requisite concepts and again after engaging with the tutorial. We analyze and discuss their improvement in performance on concepts covered in the tutorial. Published by the American Physical Society2024more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1145/3649811
