Parallel transport in rotating frames and projective holonomic quantum computation
arXiv:2405.20812 · doi:10.1103/PhysRevA.111.052429
Abstract
Nonadiabatic holonomic quantum computation is a promising approach for implementing quantum gates that offers both efficiency and robustness against certain types of errors. A key element of this approach is a geometric constraint known as the parallel transport condition. According to the principle of covariance, this condition must be appropriately modified when changing reference frames. In this paper, we detail how to adjust the parallel transport condition when transitioning from the laboratory frame to a rotating reference frame. Furthermore, building on gauge invariance considerations, we develop a framework for nonadiabatic holonomic quantum computation with projective gates. The parallel transport condition of this framework effectively addresses the problem of global dynamical phases inherent in conventional nonadiabatic holonomic quantum computation. We extend the isoholonomic inequality, which provides a fundamental bound on the efficiency of protocols used to implement holonomic quantum gates, to encompass projective quantum gates. We also determine a minimum execution time for projective holonomic quantum gates and show that this time can be attained when the codimension of the computational space is sufficiently large.
7 pages, 3 figures, matches the published version
References in corpus (6)
- Observable measure of quantum coherence in finite dimensional systems
- Single-loop multiple-pulse nonadiabatic holonomic quantum gates
- Robust and Fast Holonomic Quantum Gates with Encoding on Superconducting Circuits
- Tight lower bounds on the time it takes to generate a geometric phase
- Estimate of the time required to perform a nonadiabatic holonomic quantum computation
- Isoholonomic inequality and tight implementations of holonomic quantum gates