Energy-Consumption Advantage of Quantum Computation

Abstract

Energy consumption in solving computational problems has been gaining growing attention as one of the key performance measures for computers. Quantum computation is known to offer advantages over classical computation in terms of various computational resources; however, proving its energy-consumption advantage has been challenging due to the lack of a theoretical foundation linking the physical concept of energy with the computer-scientific notion of complexity for quantum computation. To bridge this gap, we introduce a general framework for studying the energy consumption of quantum and classical computation, based on a computational model conventionally used for studying query complexity in computational complexity theory. Within this framework, we derive an upper bound for the achievable energy consumption of quantum computation, accounting for imperfections in implementation appearing in practice. As part of this analysis, we construct a protocol for Landauer erasure with finite precision in a finite number of steps, which constitutes a contribution of independent interest. Additionally, we develop techniques for proving a nonzero lower bound of energy consumption of classical computation, based on the energy-conservation law and Landauer's principle. Using these general bounds, we rigorously prove that quantum computation achieves an exponential energy-consumption advantage over classical computation for solving a paradigmatic computational problem -- Simon's problem. Furthermore, we propose explicit criteria for experimentally demonstrating this energy-consumption advantage of quantum computation, analogous to the experimental demonstrations of quantum computational supremacy. These results establish a foundational framework and techniques to explore the energy consumption of computation, opening an alternative way to study the advantages of quantum computation.

50 pages, 6 figures

References in corpus (62)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Topological quantum memory
• Characterizing Quantum Supremacy in Near-Term Devices
• Logical quantum processor based on reconfigurable atom arrays
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Challenges and Opportunities in Quantum Machine Learning
• The Resource Theory of Quantum States Out of Thermal Equilibrium
• Quantum advantage in learning from experiments
• Catalytic Coherence
• The thermodynamic meaning of negative entropy
• Work extraction and thermodynamics for individual quantum systems
• Quantum advantage with shallow circuits
• An improved Landauer Principle with finite-size corrections
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Average-case complexity versus approximate simulation of commuting quantum computations
• A Sharp Fannes-type Inequality for the von Neumann Entropy
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• Information-theoretic bounds on quantum advantage in machine learning
• Quantum technologies need a Quantum Energy Initiative
• A derivation (and quantification) of the third law of thermodynamics
• An introductory review of the resource theory approach to thermodynamics
• Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
• Instantaneous Quantum Computation
• The quantum query complexity of the hidden subgroup problem is polynomial
• Finite-time Landauer principle
• Ideal Projective Measurements Have Infinite Resource Costs
• Quantum work and the thermodynamic cost of quantum measurements
• Landauer vs. Nernst: What is the True Cost of Cooling a Quantum System?
• One-Shot Operational Quantum Resource Theory
• Energy Cost of Creating Quantum Coherence
• Finite-Time Quantum Landauer Principle and Quantum Coherence
• Conservative Quantum Computing
• Work estimation and work fluctuations in the presence of non-ideal measurements
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage
• Gate fidelity fluctuations and quantum process invariants
• Heat-Bath Algorithmic Cooling with optimal thermalization strategies
• Third Law of Thermodynamics as a Single Inequality
• Proof of finite surface code threshold for matching
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Energy-Efficient Quantum Computing
• Optimizing resource efficiencies for scalable full-stack quantum computers
• Energetics of a Single Qubit Gate
• Uncertainty relations in implementation of unitary operations
• Sensitivity of quantum gate fidelity to laser phase and intensity noise
• How energy conservation limits our measurements
• Collective advantages in finite-time thermodynamics
• Fundamental energy requirement of reversible quantum operations
• Gaussian Thermal Operations and the Limits of Algorithmic Cooling
• Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
• Finite-time Landauer principle beyond weak coupling
• Coherence cost for violating conservation laws
• Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
• Thermodynamically optimal creation of correlations
• Cooperative quantum information erasure
• Minimum-energy pulses for quantum logic cannot be shared
• Thermodynamics of a minimal algorithmic cooling refrigerator
• The Free Energy of a General Computation
• Universal construction of decoders from encoding black boxes
• Energy requirement for implementing unitary gates on energy-unbounded systems

Cited by in corpus (10)

• Hamiltonian quantum gates -- energetic advantage from entangleability
• Monte Carlo approach for finding optimally controlled quantum gates with differential geometry
• Optimal quantum metrology under energy constraints
• Complete characterisation of state conversions by work extraction
• Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
• Multi-player conflict avoidance through entangled quantum walks
• General quantum resources providing advantages in work-extraction tasks
• Boosting Work Extraction in Quantum Batteries via Continuous Environment Monitoring
• Recent quantum runtime (dis)advantages
• Energy-Aware Metaheuristics