Quick Navigation
Topics
Trapped Ion Quantum Computing
Universal bound on the Lyapunov spectrum of quantum master equations
arXiv
Authors: Paolo Muratore-Ginanneschi, Gen Kimura, Frederik vom Ende, Dariusz Chruściński
Year
2025
Paper ID
50898
Status
Preprint
Abstract Read
~2 min
Abstract Words
210
Citations
N/A
Abstract
The spectral properties of positive maps are pivotal for understanding the dynamics of quantum systems interacting with their environment. Furthermore, central problems in quantum information such as the characterization of entanglement can be reformulated in terms of spectral properties of positive maps. The present work aims to contribute to a better understanding of the spectrum of positive maps. Specifically, our main result is a new proof of a universal bound on the d2-1 generically non vanishing decay rates Γi of time-autonomous quantum master equations on a d-dimensional Hilbert space: $Γmax leq varkappad sumi=1^{d2-1}ΓiThe prefactor\varkappa_{d}%, which we explicitly determine, depends only on the dimensiond$ and varies depending on the sub-class of positive maps to which the semigroup solution of the master equation belongs. We provide a brief but self-consistent survey of these concepts. We obtain our main result by resorting to the theory of Lyapunov exponents, a central concept in the study of dynamical systems, control theory, and out-of-equilibrium statistical mechanics. We thus show that progress in understanding positive maps in quantum mechanics may require ideas at the crossroads between different disciplines. For this reason, we adopt a notation and presentation style aimed at reaching readers with diverse backgrounds.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- The spectral properties of positive maps are pivotal for understanding the dynamics of quantum systems interacting with their environment.
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.