Quick Navigation
Topics
Trapped Ion Quantum Computing
Family of Exact and Inexact Quantum Speed Limits for Completely Positive and Trace-Preserving Dynamics
arXiv
Authors: Abhay Srivastav, Vivek Pandey, Brij Mohan, Arun Kumar Pati
Year
2024
Paper ID
66597
Status
Preprint
Abstract Read
~2 min
Abstract Words
200
Citations
N/A
Abstract
Traditional quantum speed limits formulated in density matrix space are generally unattainable for a wide class of dynamics and it is difficult to characterize the fastest possible dynamics. To address this, we present two distinct quantum speed limits in Liouville space for Completely Positive and Trace-Preserving (CPTP) dynamics. The first bound saturates for time-optimal CPTP dynamics, while the second bound is exact for all states and all CPTP dynamics. Our bounds have a clear physical and geometric interpretation arising from the uncertainty relations for operators acting on Liouville space, and the geometry of quantum evolution in Liouville space. We also obtain the form of the Liouvillian, which generates the time-optimal CPTP dynamics that connect the given initial and target states. To illustrate our findings, we show that the speed of evolution in Liouville space bounds the growth of the spectral form factor and Krylov complexity of states, which are crucial for studying information scrambling and quantum chaos. In another important application, we show that our results can help us understand the counter-intuitive phenomenon of the Mpemba effect in non-equilibrium open quantum dynamics, as the minimal relaxation time scale obtained by speed limits is dictated by the eigenmodes of the Liouvillian.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2024 reference point for readers tracking recent quantum research.
- Traditional quantum speed limits formulated in density matrix space are generally unattainable for a wide class of dynamics and it is difficult to characterize the fastest...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.