Complexity-constrained quantum thermodynamics

• URL: http://arxiv.org/abs/2403.04828v1
• Date: Thu, 7 Mar 2024 19:00:01 GMT
• Title: Complexity-constrained quantum thermodynamics
• Authors: Anthony Munson and Naga Bhavya Teja Kothakonda and Jonas Haferkamp and Nicole Yunger Halpern and Jens Eisert and Philippe Faist
• Abstract summary: We show that the minimum thermodynamic work required to reset an arbitrary state, via a complexity-constrained process, is quantified by the state's complexity entropy. The complexity entropy quantifies a trade-off between the work cost and complexity cost of resetting a state. We identify information-theoretic applications of the complexity entropy.
• Score: 0.2796197251957244
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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, via a complexity-constrained process, is quantified by the state's complexity entropy. 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 complexity relative entropy. 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 and determine the complexity entropy's behavior under random circuits. 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 complexity conditional entropy, 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 time, as quantified by complexity.

Related papers

• The complexity of entanglement embezzlement [0.0]
  We study the circuit complexity of embezzlement using sequences of states that enable arbitrary precision for the process. Our results imply that circuit complexity acts as a physical obstruction to perfect embezzlement.
  arXiv  Detail & Related papers  (2024-10-24T18:00:33Z)
• Taming Quantum Time Complexity [45.867051459785976]
  We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
  arXiv  Detail & Related papers  (2023-11-27T14:45:19Z)
• An Analysis of On-the-fly Determinization of Finite-state Automata [65.268245109828]
  We establish an abstraction of on-the-fly determinization of finite-state automata and demonstrate how it can be applied to bound the automatons. A special case of our findings is that automata with many non-deterministic transitions almost always admit a determinization of complexity.
  arXiv  Detail & Related papers  (2023-08-27T11:51:27Z)
• Quantum complexity phase transitions in monitored random circuits [0.29998889086656577]
  We study the dynamics of the quantum state complexity in monitored random circuits. We find that the evolution of the exact quantum state complexity undergoes a phase transition when changing the measurement rate.
  arXiv  Detail & Related papers  (2023-05-24T18:00:11Z)
• Circuit Complexity through phase transitions: consequences in quantum state preparation [0.0]
  We analyze the circuit complexity for preparing ground states of quantum many-body systems. In particular, how this complexity grows as the ground state approaches a quantum phase transition.
  arXiv  Detail & Related papers  (2023-01-11T19:00:10Z)
• Resource theory of quantum uncomplexity [0.5872014229110214]
  We prove Brown and Susskind's conjecture that a resource theory of uncomplexity can be defined. This work unleashes on many-body complexity the resource-theory toolkit from quantum information theory.
  arXiv  Detail & Related papers  (2021-10-21T18:00:01Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• How smooth is quantum complexity? [0.0]
  The "quantum complexity" of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. In this paper, we present a unified perspective on various notions of quantum complexity, viewed as functions on the space of unitary operators.
  arXiv  Detail & Related papers  (2021-06-15T17:58:08Z)
• Action Redundancy in Reinforcement Learning [54.291331971813364]
  We show that transition entropy can be described by two terms; namely, model-dependent transition entropy and action redundancy. Our results suggest that action redundancy is a fundamental problem in reinforcement learning.
  arXiv  Detail & Related papers  (2021-02-22T19:47:26Z)
• Catalytic Transformations of Pure Entangled States [62.997667081978825]
  Entanglement entropy is the von Neumann entropy of quantum entanglement of pure states. The relation between entanglement entropy and entanglement distillation has been known only for the setting, and the meaning of entanglement entropy in the single-copy regime has so far remained open. Our results imply that entanglement entropy quantifies the amount of entanglement available in a bipartite pure state to be used for quantum information processing, giving results an operational meaning also in entangled single-copy setup.
  arXiv  Detail & Related papers  (2021-02-22T16:05:01Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.