Abstract Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate this energy to the expected gate error. We study the entangleability (ability to entangle qubits) of Hamiltonians and highlight how this feature of quantum gates can provide a means for more energetically efficient computation. Ultimately, we show that a universal quantum computer can be realized with vanishingly low energetic requirements but at the expense of arbitrarily large complexity.
Abstract Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate this energy to the expected gate error. We study the entangleability (ability to entangle qubits) of Hamiltonians and highlight how this feature of quantum gates can provide a means for more energetically efficient computation. Ultimately, we show that a universal quantum computer can be realized with vanishingly low energetic requirements but at the expense of arbitrarily large complexity.
Abstract While recent breakthroughs in quantum computing promise the nascence of the quantum information age, quantum states remain delicate to control. Moreover, the required energy budget for large scale quantum applications has only sparely been considered. Addressing either of these issues necessitates a careful study of the most energetically efficient implementation of elementary quantum operations. In the present analysis, we show that this optimal control problem can be solved within the powerful framework of quantum speed limits. To this end, we derive state-independent lower bounds on the energetic cost, from which we find the universally optimal implementation of unitary quantum gates, for both single and N -qubit operations.
Abstract In the near future, one of the major challenges in the realization of large-scale quantum computers operating at low temperatures is the management of harmful heat loads owing to thermal conduction of cabling and dissipation at cryogenic components. This naturally raises the question that what are the fundamental limitations of energy consumption in scalable quantum computing. In this work, we derive the greatest lower bound for the gate error induced by a single application of a bosonic drive mode of given energy. Previously, such an error type has been considered to be inversely proportional to the total driving power, but we show that this limitation can be circumvented by introducing a qubit driving scheme which reuses and corrects drive pulses. Specifically, our method serves to reduce the average energy consumption per gate operation without increasing the average gate error. Thus our work shows that precise, scalable control of quantum systems can, in principle, be implemented without the introduction of excessive heat or decoherence.
Quantum computers store and manipulate information in individual quantized energy levels. These devices, not yet realized in their full potential, have the ability to perform certain computational tasks more efficiently than any classical computer. One possible way to implement a quantum computer is to use superconducting circuits controlled by single-mode electromagnetic fields. These circuits constitute the physical quantum bits, or qubits, that are used to store quantum information. A complete, fault-tolerant quantum computer potentially consists of at least millions of physical qubits which are grouped to form fault-tolerant logical qubits. Controlling each physical qubit individually requires a great amount of energy, and hence a future challenge is to reduce the energy consumption in qubit control while maintaining the high precision. In this thesis, we derive a fundamental upper bound for the gate fidelity of a single-qubit not gate implemented with a single resonant driving pulse. It is shown that the upper bound approaches unity inversely proportionally to the increasing mean photon number of the pulse. Furthermore, we find that the upper bound is achieved with an optimal superposition of squeezed states. The typically employed coherent state produces twice as high gate error as the corresponding optimal state. In addition, we present and numerically study a correction protocol that allows using the same drive state for multiple qubit operations. This sustained state is refreshed by sequentially coupling ancillary qubits to it, effectively resetting it and removing entanglement with the previously operated qubits. Thus our protocol allows using the same drive state to implement not gates for different qubits indefinitely, and hence provides a possible route to energy-efficient large-scale quantum computing.
A lower bound on the amount of energy needed to carry out an elementary logical operation on a quantum computer, with a given accuracy and in a given time, is derived. The bound arises from the requirement that the controls used to manipulate the qubits, which ultimately are themselves quan-tum mechanical systems, must nonetheless be classical to a sufficiently good approximation; it is expected to hold under a wide variety of conditions, and independently of the nature of the physical systems used to encode the qubits. This could have important consequences for very large-scale quantum computations.
Quantum computers are emerging as a promising new technology due to their ability to solve complex problems that exceed the capabilities of classical systems in terms of time. Among various implementations, superconducting qubits have become the leading technology due to their scalability and compatibility with quantum error correction mechanisms. Although time has traditionally been the primary focus, energetic efficiency is becoming an increasingly important consideration, especially with the possibility of a quantum energetic advantage. In this article, the energy consumption of the Semiclassical Quantum Fourier Transform was analyzed on a superconducting quantum computing platform based on cat qubits. Quantum error correction mechanisms were studied and considered in the energy estimations. The results show how the energy consumption scales with the number of qubits and how the most relevant parameters required for qubit stabilization, gate implementation, and error correction codes contribute to the overall energy usage. An optimization method was developed to tune these parameters with the goal of minimizing energy consumption while maintaining qubit fidelities above a given threshold. Additionally, a comparative study with state-of-the-art classical computers indicates a potential quantum energetic advantage for systems with more than 26 qubits, assuming cryogenic systems operating at Carnot efficiency, with this energetic advantage arising before any computational advantage. This behavior persists even when realistic cryogenic systems and control electronics are taken into account.
Abstract The quantum advantage threshold determines when a quantum processing unit (QPU) is more efficient with respect to classical computing hardware in terms of algorithmic complexity. The ‘green’ quantum advantage threshold—based on a comparison of energetic efficiency between the two—is going to play a fundamental role in the comparison between quantum and classical hardware. Indeed, its characterization would enable better decisions on energy-saving strategies, e.g. for distributing the workload in hybrid quantum–classical algorithms. Here, we show that the green quantum advantage threshold crucially depends on (a) the quality of the experimental quantum gates and (b) the entanglement generated in the QPU. Indeed, for noisy intermediate-scale quantum hardware and algorithms requiring a moderate amount of entanglement, a classical tensor network emulation can be more energy-efficient at equal final state fidelity than quantum computation. We compute the green quantum advantage threshold for a few paradigmatic examples in terms of algorithms and hardware platforms, and identify algorithms with a power-law decay of singular values of bipartitions—with power-law exponent α ≲ 1 —as the green quantum advantage threshold in the near future.