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.