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

A thermodynamic approach to optimization in complex quantum systems

A Imparato, Nicholas Chancellor, G De Chiara

Published Feb 16, 2024• 0 citations
Publisher
DOI
10.25405/ncl.34494501

Related papers

A thermodynamic approach to optimization in complex quantum systems

Alberto Imparato, Nicholas Chancellor, Gabriele De Chiara

Abstract We consider the problem of finding the energy minimum of a complex quantum Hamiltonian by employing a non-Markovian bath prepared in a low energy state. The energy minimization problem is thus turned into a thermodynamic cooling protocol in which we repeatedly put the system of interest in contact with a colder auxiliary system. By tuning the internal parameters of the bath, we show that the optimal cooling is obtained in a regime where the bath exhibits a quantum phase transition in the thermodynamic limit. This result highlights the importance of collective effects in thermodynamic devices. We furthermore introduce a two-step protocol that combines the interaction with the bath with a measure of its energy. While this protocol does not destroy coherence in the system of interest, we show that it can further enhance the cooling effect.

arXiv:2305.06008•Quantum Science and Technology•Feb 6, 2024•5 citations

Quantum Approach to Classical Thermodynamics and Optimization

Rolando D. Somma, Gerardo Ortíz

Lecture notes in physics•Jan 1, 2010•8 citations

Thermodynamics of Open Quantum Systems

Juliette Monsel

Springer theses•Jan 1, 2020•0 citations

Complexity-Constrained Quantum Thermodynamics

Anthony Munson, Naga Bhavya Teja Kothakonda, Jonas Haferkamp +3 more

Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the process’s complexity is restricted. We focus on the prototypical task of information erasure, or Landauer erasure, wherein an n -qubit memory is reset to the all-zero state. We show that the minimum thermodynamic work required to reset an arbitrary state in our model, via a complexity-constrained process, is quantified by the state’s . The complexity entropy therefore quantifies a trade-off between the work cost and complexity cost of resetting a state. If the qubits have a nontrivial (but product) Hamiltonian, the optimal work cost is determined by the . The complexity entropy quantifies the amount of randomness a system appears to have to a computationally limited observer. Similarly, the complexity relative entropy quantifies such an observer’s ability to distinguish two states. We prove elementary properties of the complexity (relative) entropy. In a random circuit—a simple model for quantum chaotic dynamics—the complexity entropy transitions from zero to its maximal value around the time corresponding to the observer’s computational-power limit. Also, we identify information-theoretic applications of the complexity entropy. The complexity entropy quantifies the resources required for data compression if the compression algorithm must use a restricted number of gates. We further introduce a , which arises naturally in a complexity-constrained variant of information-theoretic decoupling. Assuming that this entropy obeys a conjectured chain rule, we show that the entropy bounds the number of qubits that one can decouple from a reference system, as judged by a computationally bounded referee. Overall, our framework extends the resource-theoretic approach to thermodynamics to integrate a notion of , as quantified by .

arXiv:2403.04828•PRX Quantum•Mar 10, 2025•24 citations

Toward the nonequilibrium thermodynamic analog of complexity and the Jarzynski identity

Chen Bai, Wenhao Li, Xian-Hui Ge

Abstract The Jarzynski identity can describe small-scale nonequilibrium systems through stochastic thermodynamics. The identity considers fluctuating trajectories in a phase space. The complexity geometry frames the discussions on quantum computational complexity using the method of Riemannian geometry, which builds a bridge between optimal quantum circuits and classical geodesics in the space of unitary operators. Complexity geometry enables the application of the methods of classical physics to deal with pure quantum problems. By combining the two frameworks, i.e., the Jarzynski identity and complexity geometry, we derived a complexity analog of the Jarzynski identity using the complexity geometry. We considered a set of geodesics in the space of unitary operators instead of the trajectories in a phase space. The obtained complexity version of the Jarzynski identity strengthened the evidence for the existence of a well-defined resource theory of uncomplexity and presented an extensive discussion on the second law of complexity. Furthermore, analogous to the thermodynamic fluctuation-dissipation theorem, we proposed a version of the fluctuation-dissipation theorem for the complexity. Although this study does not focus on holographic fluctuations, we found that the results are surprisingly suitable for capturing their information. The results obtained using nonequilibrium methods may contribute to understand the nature of the complexity and study the features of the holographic fluctuations.

arXiv:2107.08608•Journal of High Energy Physics•May 20, 2022•9 citations

Optimizing Quantum Systems–An Overview

Yongshan Ding, Frederic T. Chong

Synthesis lectures on computer architecture•Jan 1, 2020•0 citations
Abstract We consider the problem of finding the energy minimum of a complex quantum Hamiltonian by employing a non-Markovian bath prepared in a low energy state. The energy minimization problem is thus turned into a thermodynamic cooling protocol in which we repeatedly put the system of interest in contact with a colder auxiliary system. By tuning the internal parameters of the bath, we show that the optimal cooling is obtained in a regime where the bath exhibits a quantum phase transition in the thermodynamic limit. This result highlights the importance of collective effects in thermodynamic devices. We furthermore introduce a two-step protocol that combines the interaction with the bath with a measure of its energy. While this protocol does not destroy coherence in the system of interest, we show that it can further enhance the cooling effect.
Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the process’s complexity is restricted. We focus on the prototypical task of information erasure, or Landauer erasure, wherein an n -qubit memory is reset to the all-zero state. We show that the minimum thermodynamic work required to reset an arbitrary state in our model, via a complexity-constrained process, is quantified by the state’s . The complexity entropy therefore quantifies a trade-off between the work cost and complexity cost of resetting a state. If the qubits have a nontrivial (but product) Hamiltonian, the optimal work cost is determined by the . The complexity entropy quantifies the amount of randomness a system appears to have to a computationally limited observer. Similarly, the complexity relative entropy quantifies such an observer’s ability to distinguish two states. We prove elementary properties of the complexity (relative) entropy. In a random circuit—a simple model for quantum chaotic dynamics—the complexity entropy transitions from zero to its maximal value around the time corresponding to the observer’s computational-power limit. Also, we identify information-theoretic applications of the complexity entropy. The complexity entropy quantifies the resources required for data compression if the compression algorithm must use a restricted number of gates. We further introduce a , which arises naturally in a complexity-constrained variant of information-theoretic decoupling. Assuming that this entropy obeys a conjectured chain rule, we show that the entropy bounds the number of qubits that one can decouple from a reference system, as judged by a computationally bounded referee. Overall, our framework extends the resource-theoretic approach to thermodynamics to integrate a notion of , as quantified by .
Abstract The Jarzynski identity can describe small-scale nonequilibrium systems through stochastic thermodynamics. The identity considers fluctuating trajectories in a phase space. The complexity geometry frames the discussions on quantum computational complexity using the method of Riemannian geometry, which builds a bridge between optimal quantum circuits and classical geodesics in the space of unitary operators. Complexity geometry enables the application of the methods of classical physics to deal with pure quantum problems. By combining the two frameworks, i.e., the Jarzynski identity and complexity geometry, we derived a complexity analog of the Jarzynski identity using the complexity geometry. We considered a set of geodesics in the space of unitary operators instead of the trajectories in a phase space. The obtained complexity version of the Jarzynski identity strengthened the evidence for the existence of a well-defined resource theory of uncomplexity and presented an extensive discussion on the second law of complexity. Furthermore, analogous to the thermodynamic fluctuation-dissipation theorem, we proposed a version of the fluctuation-dissipation theorem for the complexity. Although this study does not focus on holographic fluctuations, we found that the results are surprisingly suitable for capturing their information. The results obtained using nonequilibrium methods may contribute to understand the nature of the complexity and study the features of the holographic fluctuations.