Sample Complexity of Black Box Work Extraction

• URL: http://arxiv.org/abs/2412.02673v1
• Date: Tue, 03 Dec 2024 18:47:12 GMT
• Title: Sample Complexity of Black Box Work Extraction
• Authors: Shantanav Chakraborty, Siddhartha Das, Arnab Ghorui, Soumyabrata Hazra, Uttam Singh,
• Abstract summary: We analyze the number of samples of the unknown state required to extract work. With only a single copy of an unknown state, we prove that extracting any work is nearly impossible. Our work develops a sample-efficient protocol to assess the utility of unknown states as quantum batteries.
• Score: 0.6990493129893111
• License:
• Abstract: Extracting work from a physical system is one of the cornerstones of quantum thermodynamics. The extractable work, as quantified by ergotropy, necessitates a complete description of the quantum system. This is significantly more challenging when the state of the underlying system is unknown, as quantum tomography is extremely inefficient. In this article, we analyze the number of samples of the unknown state required to extract work. With only a single copy of an unknown state, we prove that extracting any work is nearly impossible. In contrast, when multiple copies are available, we quantify the sample complexity required to estimate extractable work, establishing a scaling relationship that balances the desired accuracy with success probability. Our work develops a sample-efficient protocol to assess the utility of unknown states as quantum batteries and opens avenues for estimating thermodynamic quantities using near-term quantum computers.

Related papers

• Sample Optimal and Memory Efficient Quantum State Tomography [6.815730801645785]
  We propose and analyse a quantum state tomography algorithm which retains sample-optimality but is also memory-efficient. Our work is built on a form of unitary Schur sampling and only requires streaming access to the samples.
  arXiv  Detail & Related papers  (2024-10-21T17:24:08Z)
• Quantumness Speeds up Quantum Thermodynamics Processes [1.3597551064547502]
  We show the coherence of quantum systems can speed up work extracting with respect to some cyclic evolution beyond all incoherent states. We further show the genuine entanglement of quantum systems may speed up work extracting beyond any bi-separablestates.
  arXiv  Detail & Related papers  (2024-06-19T08:52:19Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• The power of noisy quantum states and the advantage of resource dilution [62.997667081978825]
  Entanglement distillation allows to convert noisy quantum states into singlets. We show that entanglement dilution can increase the resilience of shared quantum states to local noise.
  arXiv  Detail & Related papers  (2022-10-25T17:39:29Z)
• Work extraction from unknown quantum sources [0.0]
  In quantum physics, ergotropy measures the amount of work extractable under cyclic Hamiltonian control. Here, we derive a new notion of ergotropy applicable when nothing is known about the quantum states produced by the source. We find that in this case the extracted work is defined by the Boltzmann and observational entropy, in cases where the measurement outcomes are, or are not, used in the work extraction.
  arXiv  Detail & Related papers  (2022-09-22T15:07:04Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Quantum verification and estimation with few copies [63.669642197519934]
  The verification and estimation of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity) and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography.
  arXiv  Detail & Related papers  (2021-09-08T18:20:07Z)
• Exergy of passive states: Waste energy after ergotropy extraction [0.0]
  We show that some amount of energy can be lost when we extract ergotropy from a quantum system and quantified by the exergy of passive states. Our study opens the perspective for new advances in open system quantum batteries.
  arXiv  Detail & Related papers  (2021-07-05T07:24:33Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.