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 条
  • [21] Finding the Optimal Subspace for Clustering
    Goebl, Sebastian
    He, Xiao
    Plant, Claudia
    Boehm, Christian
    2014 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2014, : 130 - 139
  • [22] Towards the Optimal Discriminant Subspace
    Zhou, Xichuan
    Gan, Ping
    Yan, Chao
    Li, Guojun
    2012 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT 2012), VOL 1, 2012, : 181 - 187
  • [23] Subspace Detours: Building Transport Plans that are Optimal on Subspace Projections
    Muzellec, Boris
    Cuturi, Marco
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [24] Bounds for optimal coverings
    Moreira, CGTD
    Kohayakawa, Y
    DISCRETE APPLIED MATHEMATICS, 2004, 141 (1-3) : 263 - 276
  • [25] Bounds of Optimal Learning
    Belavkin, Roman V.
    ADPRL: 2009 IEEE SYMPOSIUM ON ADAPTIVE DYNAMIC PROGRAMMING AND REINFORCEMENT LEARNING, 2009, : 199 - 204
  • [26] NEW AND UPDATED SEMIDEFINITE PROGRAMMING BOUNDS FOR SUBSPACE CODES
    Heinlein, Daniel
    Ihringer, Ferdinand
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2020, 14 (04) : 613 - 630
  • [27] Performance bounds for subspace estimation in array signal processing
    Srivastava, A
    NINTH IEEE SIGNAL PROCESSING WORKSHOP ON STATISTICAL SIGNAL AND ARRAY PROCESSING, PROCEEDINGS, 1998, : 140 - 143
  • [28] Computing eigenvalue bounds for iterative subspace matrix methods
    Zhou, YK
    Shepard, R
    Minkoff, M
    COMPUTER PHYSICS COMMUNICATIONS, 2005, 167 (02) : 90 - 102
  • [29] Covariance, subspace, and intrinsic Cramer-Rao bounds
    Smith, ST
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (05) : 1610 - 1630
  • [30] CONSTRUCTIONS AND BOUNDS FOR MIXED-DIMENSION SUBSPACE CODES
    Honold, Thomas
    Kiermaier, Michael
    Kurz, Sascha
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2016, 10 (03) : 649 - 682