Tight lower bounds on the time it takes to generate a geometric phase

被引:2
|
作者
Hornedal, Niklas [1 ]
Sonnerborn, Ole [2 ,3 ]
机构
[1] Univ Luxembourg, Dept Phys & Mat Sci, L-1511 Luxembourg, Luxembourg
[2] Karlstad Univ, Dept Math & Comp Sci, S-65188 Karlstad, Sweden
[3] Stockholm Univ, Dept Phys, S-10691 Stockholm, Sweden
关键词
geometric phase; quantum speed limit; the Margolus-Levitin quantum speed limit; the Mandelstam-Tamm quantum speed limit; quantum holonomy; QUANTUM; EVOLUTION; SPEED;
D O I
10.1088/1402-4896/acf8a2
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Tight lower bounds for dynamic time warping
    Webb, Geoffrey, I
    Petitjean, Francois
    [J]. PATTERN RECOGNITION, 2021, 115
  • [2] A FRAMEWORK FOR EXPONENTIAL-TIME-HYPOTHESIS-TIGHT ALGORITHMS AND LOWER BOUNDS IN GEOMETRIC INTERSECTION GRAPHS
    de Berg, Mark
    Bodlaender, Hans L.
    Kisfaludi-Bak, Sandor
    Marx, Daniel
    van der Zanden, Tom C.
    [J]. SIAM JOURNAL ON COMPUTING, 2020, 49 (06) : 1291 - 1331
  • [3] Tight Lower Bounds on the VC-dimension of Geometric Set Systems
    Csikos, Monika
    Mustafa, Nabil H.
    Kupayskii, Audrey
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2019, 20
  • [4] Tight lower bounds on the VC-dimension of geometric set systems
    Csikós, Monika
    Mustafa, Nabil H.
    Kupavskii, Andrey
    [J]. Journal of Machine Learning Research, 2019, 20
  • [5] A Framework for ETH-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
    de Berg, Mark
    Bodlaender, Hans L.
    Kisfaludi-Bak, Sandor
    Marx, Daniel
    van der Zanden, Tom C.
    [J]. STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 574 - 586
  • [6] Tight Running Time Lower Bounds for Vertex Deletion Problems
    Komusiewicz, Christian
    [J]. ACM TRANSACTIONS ON COMPUTATION THEORY, 2018, 10 (02)
  • [7] TIGHT LOWER BOUNDS FOR SHELLSORT
    WEISS, MA
    SEDGEWICK, R
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 255 - 262
  • [8] TIGHT LOWER BOUNDS FOR SHELLSORT
    WEISS, MA
    SEDGEWICK, R
    [J]. JOURNAL OF ALGORITHMS, 1990, 11 (02) : 242 - 251
  • [9] Tight Upper and Lower Bounds to the Information Rate of the Phase Noise Channel
    Barletta, Luca
    Magarini, Maurizio
    Spalvieri, Arnaldo
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2284 - +
  • [10] Tight Double Exponential Lower Bounds
    Bliznets, Ivan
    Hecher, Markus
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2024, 2024, 14637 : 124 - 136