Controlled quantum machines have matured significantly. A natural next step is to increasingly grant them autonomy, freeing them from time-dependent external control. For example, autonomy could pare down the classical control wires that heat and decohere quantum circuits; and an autonomous quantum refrigerator recently reset a superconducting qubit to near its ground state, as is necessary before a computation. Which fundamental conditions are necessary for realizing useful autonomous quantum machines? Inspired by recent quantum thermodynamics and chemistry, we posit conditions analogous to DiVincenzo's criteria for quantum computing. Furthermore, we illustrate the criteria with multiple autonomous quantum machines (refrigerators, circuits, clocks, etc) and multiple candidate platforms (neutral atoms, molecules, superconducting qubits, etc). Our criteria are intended to foment and guide the development of useful autonomous quantum machines.
Controlled quantum machines have matured significantly. A natural next step is to increasingly grant them autonomy, freeing them from time-dependent external control. For example, autonomy could pare down the classical control wires that heat and decohere quantum circuits; and an autonomous quantum refrigerator recently reset a superconducting qubit to near its ground state, as is necessary before a computation. Which fundamental conditions are necessary for realizing useful autonomous quantum machines? Inspired by recent quantum thermodynamics and chemistry, we posit conditions analogous to DiVincenzo's criteria for quantum computing. Furthermore, we illustrate the criteria with multiple autonomous quantum machines (refrigerators, circuits, clocks, etc) and multiple candidate platforms (neutral atoms, molecules, superconducting qubits, etc). Our criteria are intended to foment and guide the development of useful autonomous quantum machines.
Processes such as quantum computation, or the evolution of quantum cellular automata are typically described by a unitary operation implemented by an external observer. In particular, an interaction is generally turned on for a precise amount of time, using a classical clock. A fully quantum mechanical description of such a device would include a quantum description of the clock whose state is generally disturbed because of the back-reaction on it. Such a description is needed if we wish to consider finite sized autonomous quantum machines requiring no external control. The extent of the back-reaction has implications on how small the device can be, on the length of time the device can run, and is required if we want to understand what a fully quantum mechanical treatment of an observer would look like. Here, we consider the implementation of a unitary by a finite sized device which we call the "Quasi-Ideal clock", and show that the back-reaction on it can be made exponentially small in the device's dimension with only a linear increase in energy. As a result, an autonomous quantum machine need only be of modest size and or energy. We are also able to solve a long-standing open problem by using a finite sized quantum clock to approximate the continuous evolution of an Idealised clock. The result has implications on the equivalence of different paradigms of quantum thermodynamics, some which allow external control and some which only allow autonomous thermal machines.
Abstract Computation is an input–output process, where a program encoding a problem to be solved is inserted into a machine that outputs a solution. Quantum computation conventionally relies on classical, external control outside the quantum computer to execute a program, obscuring computational and thermodynamic resources required. To understand the fundamental limits of computation, however, it is pivotal to work with a fully self-contained description of a quantum computation modeling the resources on the same footing as the computation itself. By developing a framework that we dub the autonomous Quantum Processing Unit (aQPU) we model quantum computation in the framework of autonomous thermal machines. Consisting of an internal quantum timekeeping mechanism, instruction register and memory system the aQPU allows investigating relationships between thermodynamic cost, complexity, speed and fidelity of a desired quantum computation.
Abstract Autonomous quantum machines (AQMs) execute tasks without requiring time-dependent external control. Motivations for AQMs include the restrictions imposed by classical control on quantum machines’ coherence times and geometries. Most AQM work is theoretical and abstract; yet an experiment recently demonstrated AQMs’ usefulness in qubit reset, crucial to quantum computing. To further reduce quantum computing’s classical control, we propose realizations of quantum-autonomous gates on three platforms: Rydberg atoms, trapped ions, and superconducting qubits. First, we show that a Rydberg-blockade interaction or an ultrafast transition can quantum-autonomously effect entangling gates on Rydberg atoms. Passive lasers control these gates quantum-autonomously. One can perform Z or entangling gates on trapped ions quantum-autonomously, by sculpting a linear Paul trap or leveraging a ring trap. Finally, circuit quantum electrodynamics can enable quantum-autonomous Z and XY gates on superconducting qubits. The gates can serve as building blocks for (fully or partially) quantum-autonomous circuits, which may reduce classical-control burdens.
Quantum machines, grounded in the principles of quantum mechanics, harness the extraordinary computational power derived from quantum bits (qubits), contrasting with classical machines reliant on classical bits. Qubits, distinguished by properties like superposition and entanglement, empower quantum algorithms to solve intricate problems with exponential speedup. Quantum states, fundamental to quantum mechanics, serve as descriptors for quantum systems, laying the foundation for subsequent calculations. Quantum gates, unitary operators manipulating qubits, are pivotal in quantum computing, extending beyond single-particle systems to encompass multi-particle scenarios. This flexibility finds applications in quantum simulation, optimization, cryptography, machine learning, and more. Quantum computing’s potential to revolutionize fields arises from its ability to tackle computationally intractable problems. Applications span quantum simulation, optimization, cryptography, machine learning, chemistry, materials science, financial modeling, and transportation. quantum protocols, including communication and cryptography, leverage unique quantum properties. Prominent quantum algorithms, such as Deutsch-Jozsa, Bernstein-Vazirani, Grover’s, and Shor’s, exploit qubit features for efficient problem-solving. These algorithms harness superposition and entanglement, allowing parallel calculations across multiple possibilities. In the landscape of quantum computing, the interplay of quantum bits, gates, states, and algorithms showcases the potential for transformative advances in computation.
It has recently been recognized that computers could be profoundly more powerful, if the possibilities offered by the basic principles of quantum mechanics were exploited more completely in machine design. It is physically possible for the binary state of a computer itself to obey quantum mechanics, i.e., to evolve along a superposition of different (logical) pathways that could interfere with one another. This is what is meant by a quantum computer. It has recently been shown that such a computer can perform a class of computational problems, including prime factorization, very rapidly. Quantum computers will require an art that is radically different from any that the computer industry practices today. The bits of such a computer will have to be represented by the states of individual atoms. The use of one such atomic degree of freedom, the "spin", is illustrated below.
The superconducting qubit quantum computer is one of the most promising quantum computing architectures for large-scale integration due to its maturity and close proximity to the well-established semiconductor manufacturing infrastructure. From an education perspective, it also bridges classical microwave electronics and quantum electrodynamics. In this paper, we will review the basics of quantum computers, superconductivity, and Josephson junctions. We then introduce important technologies and concepts related to DiVincenzo's criteria, which are the necessary conditions for the superconducting qubits to work as a useful quantum computer. Firstly, we will discuss various types of superconducting qubits formed with Josephson junctions, from which we will understand the trade-off across multiple design parameters, including their noise immunity. Secondly, we will discuss different schemes to achieve entanglement gate operations, which are a major bottleneck in achieving more efficient fault-tolerant quantum computing. Thirdly, we will review readout engineering, including the implementations of the Purcell filters and quantum-limited amplifiers. Finally, we will discuss the nature and review the studies of two-level system defects, which are currently the limiting factor of qubit coherence time. DiVincenzo's criteria are only the necessary conditions for a technology to be eligible for quantum computing. To have a useful quantum computer, large-scale integration is required. We will review proposals and developments for the large-scale integration of superconducting qubit devices. By comparing with the application of electronic design automation (EDA) in semiconductors, we will also review the use of EDA in superconducting qubit quantum computer design, which is necessary for its large-scale integration.