Tight lower bounds on the time it takes to generate a geometric phase
arXiv:2305.12156 · doi:10.1088/1402-4896/acf8a2
Abstract
Geometric phase is a concept of central importance in virtually every branch of physics. In this paper, we show that the evolution time of a cyclically evolving quantum system is restricted by the system's energy resources and the geometric phase acquired by the state. Specifically, we derive and examine three tight lower bounds on the time required to generate any prescribed Aharonov-Anandan geometric phase. The derivations are based on recent results on the geometric character of the Mandelstam-Tamm and Margolus-Levitin quantum speed limits.
arXiv comment11 pages, 2 figures, identical to the published article
References in corpus (19)
- Concentrating Partial Entanglement by Local Operations
- Classification of topological quantum matter with symmetries
- Holonomic Quantum Computation
- The maximum speed of dynamical evolution
- Quantum speed limits: from Heisenberg's uncertainty principle to optimal quantum control
- Non-adiabatic holonomic quantum computation
- Quantum limits to dynamical evolution
- Quantum Brachistochrone
- Time Optimal Unitary Operations
- Quantum brachistochrone curves as geodesics: obtaining accurate control protocols for time-optimal quantum gates
- Quantum Speed Limit for States with a Bounded Energy Spectrum
- Topological phase for entangled two-qubit states
- Quantum Brachistochrone for Mixed States
- Phase Dynamics of Two Entangled Qubits
- Extensions of the Mandelstam-Tamm quantum speed limit to systems in mixed states
- Exact solutions of the isoholonomic problem and the optimal control problem in holonomic quantum computation
- Margolus-Levitin quantum speed limit for an arbitrary fidelity
- Time-optimal quantum transformations with bounded bandwidth
- Closed systems refuting quantum-speed-limit hypotheses
Cited by in corpus (5)
- Margolus-Levitin quantum speed limit for an arbitrary fidelity
- Estimate of the time required to perform a nonadiabatic holonomic quantum computation
- Isoholonomic inequality and tight implementations of holonomic quantum gates
- Parallel transport in rotating frames and projective holonomic quantum computation
- Systems that saturate the Margolus-Levitin quantum speed limit