Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1604.03749 · New Journal of Physics

The thermodynamic cost of quantum operations

D J Bedingham, O. J. E. Maroney

Published Nov 24, 2016• 25 citations
arXivHTMLPDF

Abstract

The amount of heat generated by computers is rapidly becoming one of the main problems for developing new generations of information technology. The thermodynamics of computation sets the ultimate physical bounds on heat generation. A lower bound is set by the Landauer limit, at which computation becomes thermodynamically reversible. For classical computation there is no physical principle which prevents this limit being reached, and approaches to it are already being experimentally tested. In this paper we show that for quantum computation with a set of signal states satisfying given conditions, there is an unavoidable excess heat generation that renders it inherently thermodynamically irreversible. The Landauer limit cannot, in general, be reached by quantum computers. We show the existence of a lower bound to the heat generated by quantum computing that exceeds that given by the Landauer limit, give the special conditions where this excess cost may be avoided, and provide a protocol for achieving the limiting heat cost when these conditions are met. We also show how classical computing falls within the special conditions.

DOI
10.1088/1367-2630/18/11/113050

Related papers

On the inherent thermodynamics of quantum information processing

Jake Xuereb

A thermodynamically irreversible process generates entropy and dissipates heat. The processing of bits of information can itself at times feature irreversible acts, such as the deletion of a bit, which as demonstrated by Landauer and expanded on by Bennett leads to heat exchange with an environment. This foundationalrelationship between thermodynamic and logical irreversibility invites us to examine this idea in a more general context.Within the domain of quantum information processing, quantum physics mathematically furnishes our information source with a Hilbert space allowing for more general operations. This leads to sources of thermodynamics which were not present in the domain of bits. The generation of non-classical resources such as entanglement towards a computational goal and the accurate autonomous control of a quantum system to carry out a computation both come at a thermodynamic cost. Beyond this, quantum systems are fragile and interaction with their environments leads to error whose impact and mitigation has thermodynamic repercussions.Throughout this project we will explore these connections from different perspectives. Firstly a foundational standpoint, to understand what limitations thermodynamics places on the quantum computations we can carry out and their complexity. Secondly from a pragmatic standpoint, to understand the role ofthermodynamics in the scaling of fault-tolerant quantum computation. In doing so developing a more complete picture on the inherent thermodynamics of quantum information processing and its many different facets.

•Jun 1, 2026•0 citations

Quantum vs Classical Erasure: Equal Bounds but Unequal Costs

Jan Neuser, Jake Xuereb, Pharnam Bakhshinezhad +1 more

Irreversibility has a fundamental thermodynamic cost, erasing information inevitably generates heat. This connection is quantified by the Landauer bound, which gives the minimum dissipation needed to erase a single bit of information. While this bound applies in both classical and quantum settings, it is saturated only in idealised limits of infinite resources. Here, we provide a unified first principles description of finite-resource erasure in both classical and quantum systems. We begin by proving the communal folklore that in the idealised regime the erasure cost of a bit encoded in a quantum or classical system is the same. Despite this, we show that their practical implementation differs substantially: achieving comparable erasure quality in quantum systems requires more control, larger accessible energy gaps and longer operation times. Classical protocols can achieve the erasure of a comparable quantum protocol under far weaker constraints which we expose in trade-off relations. Our results explain why practical erasure schemes fall short of Landauer's bound and show that classical systems enjoy several fundamental thermodynamic advantages.

quant-pharXiv:2607.27341•Jul 31, 2026•0 citations

Fundamental Energy Requirement of Reversible Quantum Operations

Giulio Chiribella, Yuxiang Yang, Renato Renner

Landauer’s principle asserts that any computation has an unavoidable energy cost that grows proportionally to its degree of logical irreversibility. But even a logically reversible operation, when run on a physical processor that operates on different energy levels, requires energy. Here we quantify this energy requirement, providing upper and lower bounds that coincide up to a constant factor. We derive these bounds from a general quantum resource-theoretic argument, which implies that the initial resource requirement for implementing a unitary operation within an error ε grows like 1/√ε times the amount of resource generated by the operation. Applying these results to quantum circuits, we find that their energy requirement can, by an appropriate design, be made independent of their time complexity.

•Apr 1, 2021•29 citations

Fundamental Energy Requirement of Reversible Quantum Operations

Giulio Chiribella, Yuxiang Yang, Renato Renner

Landauer's principle asserts that any computation has an unavoidable energy cost that grows proportionally to its degree of logical irreversibility.But even a logically reversible operation, when run on a physical processor that operates on different energy levels, requires energy.Here we quantify this energy requirement, providing upper and lower bounds that coincide up to a constant factor.We derive these bounds from a general quantum resource-theoretic argument, which implies that the initial resource requirement for implementing a unitary operation within an error ϵ grows like 1= ffiffi ffi ϵ p times the amount of resource generated by the operation.Applying these results to quantum circuits, we find that their energy requirement can, by an appropriate design, be made independent of their time complexity.

arXiv:1908.10884•Physical Review X•Apr 15, 2021•41 citations

A Universal Constraint on Computational Rates in Physical Systems

Hannah Earley

Conventional computing has many sources of heat dissipation, but one of these--the Landauer limit--poses a fundamental lower bound of 1 bit of entropy per bit erased. 'Reversible Computing' avoids this source of dissipation, but is dissipationless computation possible? In this paper, a general proof is given for open quantum systems showing that a computer thermally coupled to its environment will necessarily dissipate entropy (and hence heat). Specifically, a lower bound is obtained that corresponds to the adiabatic regime, in which the amount of entropy dissipated per computational operation is proportional to the rate of computation.

arXiv:2208.11196•Aug 23, 2022•0 citations

Thermodynamic Limits of Fault-Tolerant Quantum Computing Beyond the Weak-Coupling, Quasistatic Regime

Mrittunjoy Guha Majumdar

The standard Landauer bound W≥kBTln2 sets the fundamental thermodynamic cost for information erasure under ideal conditions: weak system-bath coupling, quasistatic operation, and equilibrium reservoirs. However, realistic quantum error correction (QEC) operates in a profoundly different regime-finite-time syndrome extraction, strong coupling to cryogenic environments, and non-equilibrium dynamics. Here, we develop a unified thermodynamic framework for fault-tolerant quantum computing that incorporates corrections beyond the ideal Landauer limit. We derive a generalized bound on the heat dissipation per QEC cycle: Qmin≥kBTln2+kBTΔISB+ℏτ, and scaling this result to large-scale quantum computers, we find that the total heat load grows polynomially with code distance but remains in the nanowatt range for million-qubit systems-well within the cooling power of modern dilution refrigerators. Applying our model to superconducting qubit architectures, we show that while strong coupling can add up to ∼20% to the ideal cost, finite-time effects contribute approximately 0.55% at 100 ns and 5.5% at 10 ns reset operations. Our results establish that the true thermodynamic cost of fault tolerance, while exceeding the naive Landauer estimate, does not pose a fundamental obstacle to scalability; the dominant engineering challenges lie in the heat load of control electronics and wiring, not in the fundamental dissipation of qubit reset.

Entropy•May 11, 2026•1 citation
The amount of heat generated by computers is rapidly becoming one of the main problems for developing new generations of information technology. The thermodynamics of computation sets the ultimate physical bounds on heat generation. A lower bound is set by the Landauer limit, at which computation becomes thermodynamically reversible. For classical computation there is no physical principle which prevents this limit being reached, and approaches to it are already being experimentally tested. In this paper we show that for quantum computation with a set of signal states satisfying given conditions, there is an unavoidable excess heat generation that renders it inherently thermodynamically irreversible. The Landauer limit cannot, in general, be reached by quantum computers. We show the existence of a lower bound to the heat generated by quantum computing that exceeds that given by the Landauer limit, give the special conditions where this excess cost may be avoided, and provide a protocol for achieving the limiting heat cost when these conditions are met. We also show how classical computing falls within the special conditions.
A thermodynamically irreversible process generates entropy and dissipates heat. The processing of bits of information can itself at times feature irreversible acts, such as the deletion of a bit, which as demonstrated by Landauer and expanded on by Bennett leads to heat exchange with an environment. This foundationalrelationship between thermodynamic and logical irreversibility invites us to examine this idea in a more general context.Within the domain of quantum information processing, quantum physics mathematically furnishes our information source with a Hilbert space allowing for more general operations. This leads to sources of thermodynamics which were not present in the domain of bits. The generation of non-classical resources such as entanglement towards a computational goal and the accurate autonomous control of a quantum system to carry out a computation both come at a thermodynamic cost. Beyond this, quantum systems are fragile and interaction with their environments leads to error whose impact and mitigation has thermodynamic repercussions.Throughout this project we will explore these connections from different perspectives. Firstly a foundational standpoint, to understand what limitations thermodynamics places on the quantum computations we can carry out and their complexity. Secondly from a pragmatic standpoint, to understand the role ofthermodynamics in the scaling of fault-tolerant quantum computation. In doing so developing a more complete picture on the inherent thermodynamics of quantum information processing and its many different facets.
Irreversibility has a fundamental thermodynamic cost, erasing information inevitably generates heat. This connection is quantified by the Landauer bound, which gives the minimum dissipation needed to erase a single bit of information. While this bound applies in both classical and quantum settings, it is saturated only in idealised limits of infinite resources. Here, we provide a unified first principles description of finite-resource erasure in both classical and quantum systems. We begin by proving the communal folklore that in the idealised regime the erasure cost of a bit encoded in a quantum or classical system is the same. Despite this, we show that their practical implementation differs substantially: achieving comparable erasure quality in quantum systems requires more control, larger accessible energy gaps and longer operation times. Classical protocols can achieve the erasure of a comparable quantum protocol under far weaker constraints which we expose in trade-off relations. Our results explain why practical erasure schemes fall short of Landauer's bound and show that classical systems enjoy several fundamental thermodynamic advantages.
Landauer’s principle asserts that any computation has an unavoidable energy cost that grows proportionally to its degree of logical irreversibility. But even a logically reversible operation, when run on a physical processor that operates on different energy levels, requires energy. Here we quantify this energy requirement, providing upper and lower bounds that coincide up to a constant factor. We derive these bounds from a general quantum resource-theoretic argument, which implies that the initial resource requirement for implementing a unitary operation within an error ε grows like 1/√ε times the amount of resource generated by the operation. Applying these results to quantum circuits, we find that their energy requirement can, by an appropriate design, be made independent of their time complexity.
Landauer's principle asserts that any computation has an unavoidable energy cost that grows proportionally to its degree of logical irreversibility.But even a logically reversible operation, when run on a physical processor that operates on different energy levels, requires energy.Here we quantify this energy requirement, providing upper and lower bounds that coincide up to a constant factor.We derive these bounds from a general quantum resource-theoretic argument, which implies that the initial resource requirement for implementing a unitary operation within an error ϵ grows like 1= ffiffi ffi ϵ p times the amount of resource generated by the operation.Applying these results to quantum circuits, we find that their energy requirement can, by an appropriate design, be made independent of their time complexity.
Conventional computing has many sources of heat dissipation, but one of these--the Landauer limit--poses a fundamental lower bound of 1 bit of entropy per bit erased. 'Reversible Computing' avoids this source of dissipation, but is dissipationless computation possible? In this paper, a general proof is given for open quantum systems showing that a computer thermally coupled to its environment will necessarily dissipate entropy (and hence heat). Specifically, a lower bound is obtained that corresponds to the adiabatic regime, in which the amount of entropy dissipated per computational operation is proportional to the rate of computation.
The standard Landauer bound W≥kBTln2 sets the fundamental thermodynamic cost for information erasure under ideal conditions: weak system-bath coupling, quasistatic operation, and equilibrium reservoirs. However, realistic quantum error correction (QEC) operates in a profoundly different regime-finite-time syndrome extraction, strong coupling to cryogenic environments, and non-equilibrium dynamics. Here, we develop a unified thermodynamic framework for fault-tolerant quantum computing that incorporates corrections beyond the ideal Landauer limit. We derive a generalized bound on the heat dissipation per QEC cycle: Qmin≥kBTln2+kBTΔISB+ℏτ, and scaling this result to large-scale quantum computers, we find that the total heat load grows polynomially with code distance but remains in the nanowatt range for million-qubit systems-well within the cooling power of modern dilution refrigerators. Applying our model to superconducting qubit architectures, we show that while strong coupling can add up to ∼20% to the ideal cost, finite-time effects contribute approximately 0.55% at 100 ns and 5.5% at 10 ns reset operations. Our results establish that the true thermodynamic cost of fault tolerance, while exceeding the naive Landauer estimate, does not pose a fundamental obstacle to scalability; the dominant engineering challenges lie in the heat load of control electronics and wiring, not in the fundamental dissipation of qubit reset.