Zero-Fluctuation Quantum Work Extraction
- URL: http://arxiv.org/abs/2402.16964v1
- Date: Mon, 26 Feb 2024 19:01:42 GMT
- Title: Zero-Fluctuation Quantum Work Extraction
- Authors: Raffaele Salvia and Vittorio Giovannetti
- Abstract summary: We study the possibility of deterministic protocols for extracting work from quantum systems.
We prove that, with enough copies of the system, such zero-fluctuation protocols always exist if the Hamiltonian has a rational spectrum.
- Score: 0.7252027234425332
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study the possibility of deterministic protocols for extracting work from
quantum systems. Focusing on the two-point measurement work extraction
scenario, we prove that, with enough copies of the system, such
zero-fluctuation protocols always exist if the Hamiltonian has a rational
spectrum. Leveraging this result, we show that for any Hamiltonian, it is
possible to construct an unitary driving protocol on sufficiently many copies
of the system with work fluctuations strictly bounded within an arbitrary
interval $\pm \delta$, albeit requiring exponentially many copies in
$1/\delta$.
Related papers
- Sample Complexity of Black Box Work Extraction [0.6990493129893111]
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.
arXiv Detail & Related papers (2024-12-03T18:47:12Z) - Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another.
We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST.
The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
arXiv Detail & Related papers (2024-05-10T23:46:35Z) - Quantum Hamiltonian Learning for the Fermi-Hubbard Model [10.391338066539237]
Heisenberg-limited scaling is achieved while allowing for state preparation and measurement errors.
Our method only involves simple one or two-site Fermionic manipulations.
arXiv Detail & Related papers (2023-12-28T22:32:40Z) - An efficient and exact noncommutative quantum Gibbs sampler [0.0]
We construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians.
Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm.
arXiv Detail & Related papers (2023-11-15T18:51:24Z) - Extraction of Work via a Thermalization Protocol [0.0]
We show that it is possible to exploit a thermalization process to extract work from a resource system $R$ to a bipartite system $S$.
We find the theoretical bounds of the protocol in the general case and show that when applied to the Rabi model it gives rise to a satisfactory extraction of work and efficiency.
arXiv Detail & Related papers (2023-09-08T08:01:40Z) - Sparse random Hamiltonians are quantumly easy [105.6788971265845]
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems.
This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state.
Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
arXiv Detail & Related papers (2023-02-07T10:57:36Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Unveiling quantum entanglement in many-body systems from partial
information [0.0]
This paper introduces a flexible data-driven entanglement detection technique for uncharacterized quantum many-body states.
It is of immediate relevance to experiments in a quantum advantage regime.
arXiv Detail & Related papers (2021-07-08T16:17:02Z) - Stoquasticity in circuit QED [78.980148137396]
We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems.
We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
arXiv Detail & Related papers (2020-11-02T16:41:28Z) - Proposal to measure out-of-time-ordered correlations using Bell states [0.0]
We present a protocol to experimentally measure the infinite-temperature out-of-time-ordered correlation (OTOC)
OTOC is a probe of quantum information scrambling in a system.
We show that the OTOC can be obtained by preparing two entangled systems.
arXiv Detail & Related papers (2020-06-26T16:51:32Z) - Genuine Network Multipartite Entanglement [62.997667081978825]
We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$.
We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
arXiv Detail & Related papers (2020-02-07T13:26:00Z)
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.