Optimal bounds on the speed of subspace evolution*

被引:1
|
作者
Albeverio, Sergio [1 ,2 ]
Motovilov, Alexander K. [3 ,4 ]
机构
[1] Univ Bonn, Inst Appl Math, Endenicher Allee 60, D-53115 Bonn, Germany
[2] Univ Bonn, Hausdorff Ctr Math, Endenicher Allee 60, D-53115 Bonn, Germany
[3] JINR, Bogoliubov Lab Theoret Phys, Joliot Curie 6, Dubna 141980, Russia
[4] Dubna State Univ, Univ Skaya 19, Dubna 141980, Russia
关键词
Mandelstam-Tamm inequality; quantum speed limit; subspace evolution; OPTIMAL TIME EVOLUTION;
D O I
10.1088/1751-8121/ac6bcf
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
By a quantum speed limit one usually understands an estimate on how fast a quantum system can evolve between two distinguishable states. The most known quantum speed limit is given in the form of the celebrated Mandelstam-Tamm inequality that bounds the speed of the evolution of a state in terms of its energy dispersion. In contrast to the basic Mandelstam-Tamm inequality, we are concerned not with a single state but with a (possibly infinite-dimensional) subspace which is subject to the Schrodinger evolution. By using the concept of maximal angle between subspaces we derive optimal bounds on the speed of such a subspace evolution. These bounds may be viewed as further generalizations of the Mandelstam-Tamm inequality. Our study includes the case of unbounded Hamiltonians.
引用
收藏
页数:17
相关论文
共 50 条
  • [41] An optimal subspace analysis for face recognition
    Zhao, HT
    Yuen, PC
    Yang, JY
    BIOMETRIC AUTHENTICATION, PROCEEDINGS, 2004, 3072 : 95 - 101
  • [42] How to Determine an Optimal Noise Subspace?
    Xu, Kaijie
    Xing, Mengdao
    Cui, Ye
    Tian, Guangdong
    IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2023, 20
  • [43] Large optimal cyclic subspace codes
    Zhang, He
    Tang, Chunming
    Cao, Xiwang
    DISCRETE MATHEMATICS, 2024, 347 (07)
  • [44] EFFICIENT BOUNDS AND ESTIMATES FOR CANONICAL ANGLES IN RANDOMIZED SUBSPACE APPROXIMATIONS
    Dong, Yijun
    Martinsson, Per-Gunnar
    Nakatsukasa, Yuji
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2024, 45 (04) : 1978 - 2006
  • [45] Software for computing eigenvalue bounds for iterative subspace matrix methods
    Shepard, R
    Minkoff, M
    Zhou, YK
    COMPUTER PHYSICS COMMUNICATIONS, 2005, 170 (01) : 109 - 114
  • [46] Intrinsic Cramer-Rao bounds and subspace estimation accuracy
    Smith, ST
    SAM 2000: PROCEEDINGS OF THE 2000 IEEE SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP, 2000, : 489 - 493
  • [47] ERROR BOUNDS FOR THE KRYLOV SUBSPACE METHODS FOR COMPUTATIONS OF MATRIX EXPONENTIALS
    Wang, Hao
    Ye, Qiang
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2017, 38 (01) : 155 - 187
  • [48] Tight Bounds for l1 Oblivious Subspace Embeddings
    Wang, Ruosong
    Woodruff, David P.
    ACM TRANSACTIONS ON ALGORITHMS, 2022, 18 (01)
  • [49] BOUNDS FOR OPTIMAL FLOW-CONTROL WINDOW SIZE DESIGN WITH APPLICATION TO HIGH-SPEED NETWORKS
    BOURNAS, RM
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1995, 332B (01): : 77 - 89
  • [50] Optimal bounds on texture coefficients
    Paroni, R
    JOURNAL OF ELASTICITY, 2000, 60 (01) : 19 - 34