Quantum Foundations of Classical Reversible Computing

被引:5
|
作者
Frank, Michael P. [1 ]
Shukla, Karpur [2 ]
机构
[1] Sandia Natl Labs, Ctr Comp Res, Albuquerque, NM 87185 USA
[2] Brown Univ, Dept Elect & Comp Engn, Providence, RI 02906 USA
关键词
non-equilibrium quantum thermodynamics; thermodynamics of computing; Landauer's principle; Landauer limit; reversible computing; resource theory of quantum thermodynamics; Gorini-Kossakowski-Sudarshan-Lindblad dynamics; Lindbladians; von Neumann entropy; Renyi entropy; open quantum systems; THERMODYNAMICS; COMPUTATION; MECHANICS; HEAT;
D O I
10.3390/e23060701
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The reversible computation paradigm aims to provide a new foundation for general classical digital computing that is capable of circumventing the thermodynamic limits to the energy efficiency of the conventional, non-reversible digital paradigm. However, to date, the essential rationale for, and analysis of, classical reversible computing (RC) has not yet been expressed in terms that leverage the modern formal methods of non-equilibrium quantum thermodynamics (NEQT). In this paper, we begin developing an NEQT-based foundation for the physics of reversible computing. We use the framework of Gorini-Kossakowski-Sudarshan-Lindblad dynamics (a.k.a. Lindbladians) with multiple asymptotic states, incorporating recent results from resource theory, full counting statistics and stochastic thermodynamics. Important conclusions include that, as expected: (1) Landauer's Principle indeed sets a strict lower bound on entropy generation in traditional non-reversible architectures for deterministic computing machines when we account for the loss of correlations; and (2) implementations of the alternative reversible computation paradigm can potentially avoid such losses, and thereby circumvent the Landauer limit, potentially allowing the efficiency of future digital computing technologies to continue improving indefinitely. We also outline a research plan for identifying the fundamental minimum energy dissipation of reversible computing machines as a function of speed.
引用
收藏
页数:68
相关论文
共 50 条
  • [1] Quantum vertex model for reversible classical computing
    Chamon, C.
    Mucciolo, E. R.
    Ruckenstein, A. E.
    Yang, Z. -C.
    [J]. NATURE COMMUNICATIONS, 2017, 8
  • [2] Quantum vertex model for reversible classical computing
    C. Chamon
    E. R. Mucciolo
    A. E. Ruckenstein
    Z.-C. Yang
    [J]. Nature Communications, 8
  • [3] Quantum Computating from Reversible Classical Computing
    Heunen, Chris
    [J]. TWENTY YEARS OF THEORETICAL AND PRACTICAL SYNERGIES, CIE 2024, 2024, 14773 : XXXI - XXXI
  • [4] Foundations of Generalized Reversible Computing
    Frank, Michael P.
    [J]. REVERSIBLE COMPUTATION, RC 2017, 2017, 10301 : 19 - 34
  • [5] CLASSICAL FOUNDATIONS OF QUANTUM LOGIC
    GAROLA, C
    [J]. INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1991, 30 (01) : 1 - 52
  • [6] CLASSICAL FOUNDATIONS OF QUANTUM GROUPS
    FRONSDAL, C
    [J]. FOUNDATIONS OF PHYSICS, 1993, 23 (04) : 551 - 569
  • [7] Quantum Computing's Classical Problem, Classical Computing's Quantum Problem
    Van Meter, Rodney
    [J]. FOUNDATIONS OF PHYSICS, 2014, 44 (08) : 819 - 828
  • [8] Quantum Computing’s Classical Problem, Classical Computing’s Quantum Problem
    Rodney Van Meter
    [J]. Foundations of Physics, 2014, 44 : 819 - 828
  • [9] From classical computing to quantum computing
    Barila, Adina
    [J]. 2014 INTERNATIONAL CONFERENCE ON DEVELOPMENT AND APPLICATION SYSTEMS (DAS), 2014, : 196 - 203
  • [10] Reversible Computing: Foundations and SoftwarePreface of Special Issue
    Robert Glück
    Tetsuo Yokoyama
    [J]. New Generation Computing, 2018, 36 : 143 - 144