Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.03247 v2 pith:YRZB5XLV submitted 2024-04-04 quant-ph

Stronger speed limit for observables: Tight bound for the capacity of entanglement, the modular Hamiltonian and the charging of a quantum battery

classification quant-ph
keywords quantumlimitspeedboundstrongerbatterytimecapacity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

How fast an observable can evolve in time is answered by so-called ``observable speed limit". Here, we prove a stronger version of the observable speed limit and show that the previously obtained bound is a special case of the new bound. The stronger quantum speed limit for the state also follows from the stronger quantum speed limit for observables (SQSLO). We apply this to prove a stronger bound for the entanglement rate using the notion of capacity of entanglement (the quantum information theoretic counterpart of the heat capacity), and show that it outperforms previous bounds. Furthermore, we apply the SQSLO for the rate of modular Hamiltonian and in the context of interacting qubits in a quantum battery. These illustrative examples reveal that the speed limit for the modular energy and the time required to charge the battery can be exactly predicted using the new bound. This shows that for estimating the charging time of quantum battery, SQSLO is actually tight, i.e. it saturates. Our findings can have important applications in quantum thermodynamics, the complexity of operator growth, predicting the time rate of quantum correlation growth, and quantum technology in general.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.