Saturable Quantum Speed Limits for Imaginary-Time Evolution

We derive a Geometric quantum speed limit (QSL) for imaginary-time evolution, where the dynamics is governed by a non-unitary Schrödinger equation. By introducing a cost function based on the angular distance between the normalized evolving state and the initial state, we obtain a lower bound on the evolution time expressed as the ratio between this angle and the time-averaged energy dispersion. Our bound is analytical, general, and applicable to arbitrary time-independent Hamiltonians. We analytically evaluate this bound for two physically motivated cases. First, we apply it to a two-level system and derive an expression for the minimal time. Second, we analyze the imaginary-time version of Grover search problem and rigorously reproduce the well-known logarithmic scaling $T=\mathcal{ O}(\log N)$ within our QSL framework.

Publication Details

Journal
ArXiv.org
Published
2025-08-14
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Saturable Quantum Speed Limits for Imaginary-Time Evolution

ArXiv.org
Quantum Computing Algorithms and Architecture
article

Saturable Quantum Speed Limits for Imaginary-Time Evolution

article en

Abstract

We derive a Geometric quantum speed limit (QSL) for imaginary-time evolution, where the dynamics is governed by a non-unitary Schrödinger equation. By introducing a cost function based on the angular distance between the normalized evolving state and the initial state, we obtain a lower bound on the evolution time expressed as the ratio between this angle and the time-averaged energy dispersion. Our bound is analytical, general, and applicable to arbitrary time-independent Hamiltonians. We analytically evaluate this bound for two physically motivated cases. First, we apply it to a two-level system and derive an expression for the minimal time. Second, we analyze the imaginary-time version of Grover search problem and rigorously reproduce the well-known logarithmic scaling $T=\mathcal{ O}(\log N)$ within our QSL framework.

ArXiv.org
Openalex Percentile: Top 73%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Saturable Quantum Speed Limits for Imaginary-Time Evolution · ArXiv.org (2025) | TGRS Research Map | TGRS