Quantum state readout on many experimental platforms is performed through a single projective measurement channel rather than full quantum state tomography. We derive a detector-conditioned quantum speed limit that constrains the minimum time for the projective fidelity $F(t) = \langle\omega|\rho(t)|\omega\rangle$ to reach a prescribed discrimination threshold: $T \;\ge\; \frac{|\Theta(0) - \Theta_*|}{\Delta H_\omega},$ where $\Theta = \arccos\sqrt{F}$ is the Bures angle and $\Delta H_\omega$ is the energy standard deviation of the \emph{fixed target state}. This bound, valid for both pure and mixed states under unitary dynamics, expresses the speed constraint in terms of a time-independent quantity determined entirely by the Hamiltonian and the detector projector, rather than the evolving-state variance appearing in standard Mandelstam--Tamm-type bounds. We further show that the resulting bound is structurally distinct from standard Mandelstam--Tamm-type bounds based on evolving-state variance. The bound exhibits commuting-sector invariance, suppressing Hamiltonian components that are energetically large but detection-irrelevant. Exact diagonalization of the transverse-field Ising model for $N \le 12$ spins confirms asymptotic separation between the bounds in the strong-interaction regime. The framework provides a detector-conditioned lower bound for rank-1 projective detection dynamics, applicable to superconducting qubit readout, trapped-ion fluorescence detection, and stabilizer syndrome monitoring. The construction is particularly relevant for architectures in which experimentally accessible information is restricted to a small set of projective readout channels rather than full-state tomography. ## Results & Validation Below is the macro-level data extracted from the 156-qubit **ibm_fez** processor, confirming the asymptotic separation predicted by Theorem 5.2 as the many-body coupling strength scales extensively: [Quantum Speed Limit Validation Benchmark](qsl_validation_plot.png) ## Hardware Compilation Profile The transpiled circuit diagram below illustrates the native pulse-level gate routing on the IBM Quantum Heron architecture. By optimizing the physical register map, the compiler enforces a clean nearest-neighbor coupling loop with zero SWAP gate overhead: [Heron Chip Circuit Native Compilation](circuit-d8uhclsbp3hs73861d7g.png) ## Raw Measurement Diagnostics To evaluate the projective fidelity reduction threshold ( $F_* = 0.15$ ), raw binary distributions are unpacked and corrected using Matrix-Free Measurement Mitigation (M3). Below is a representative diagnostic histogram of single-outcome state frequencies sampled from the hardware backend: [Error Mitigated Hardware Measurement Histogram](job_d8uhc4ctqbtc73d1qdmg_results_c.png)Quantum state readout on many experimental platforms is performed through a single projective measurement channel rather than full quantum state tomography. We derive a detector-conditioned quantum speed limit that constrains the minimum time for the projective fidelity $F(t) = \langle\omega|\rho(t)|\omega\rangle$ to reach a prescribed discrimination threshold:\[T \;\ge\; \frac{|\Theta(0) - \Theta_*|}{\Delta H_\omega},\]where $\Theta = \arccos\sqrt{F}$ is the Bures angle and $\Delta H_\omega$ is the energy standard deviation of the \emph{fixed target state}. This bound, valid for both pure and mixed states under unitary dynamics, expresses the speed constraint in terms of a time-independent quantity determined entirely by the Hamiltonian and the detector projector, rather than the evolving-state variance appearing in standard Mandelstam--Tamm-type bounds. We further show that the resulting bound is structurally distinct from standard Mandelstam--Tamm-type bounds based on evolving-state variance. The bound exhibits commuting-sector invariance, suppressing Hamiltonian components that are energetically large but detection-irrelevant. Exact diagonalization of the transverse-field Ising model for $N \le 12$ spins confirms asymptotic separation between the bounds in the strong-interaction regime. The framework provides a detector-conditioned lower bound for rank-1 projective detection dynamics, applicable to superconducting qubit readout, trapped-ion fluorescence detection, and stabilizer syndrome monitoring. The construction is particularly relevant for architectures in which experimentally accessible information is restricted to a small set of projective readout channels rather than full-state tomography. ## Results & Validation Below is the macro-level data extracted from the 156-qubit **ibm_fez** processor, confirming the asymptotic separation predicted by Theorem 5.2 as the many-body coupling strength scales extensively: [Quantum Speed Limit Validation Benchmark](qsl_validation_plot.png) ## Hardware Compilation Profile The transpiled circuit diagram below illustrates the native pulse-level gate routing on the IBM Quantum Heron architecture. By optimizing the physical register map, the compiler enforces a clean nearest-neighbor coupling loop with zero SWAP gate overhead: [Heron Chip Circuit Native Compilation](circuit-d8uhclsbp3hs73861d7g.png) ## Raw Measurement Diagnostics To evaluate the projective fidelity reduction threshold ($F_* = 0.15$), raw binary distributions are unpacked and corrected using Matrix-Free Measurement Mitigation (M3). Below is a representative diagnostic histogram of single-outcome state frequencies sampled from the hardware backend: [Error Mitigated Hardware Measurement Histogram](job_d8uhc4ctqbtc73d1qdmg_results_c.png)

Jun 14, 20260 citations

Quantum speed limits and optimal hamiltonians for driven systems in mixed states

Ole Sönnerborn, Hoshang Heydari

Abstract. Inequalities of Mandelstam-Tamm and Margolus-Levitin type provide lower bounds on the time it takes for a quantum system to evolve from one state into another. Knowledge of such bounds, called quantum speed limits, is of utmost importance in virtually all areas of physics, where determination of the minimum time required for a quantum process is of interest. Most Mandelstam-Tamm and Margolus-Levitin inequalities found in the literature have been derived from growth estimates for the Bures length, which is a statistical distance measure. In this paper we derive such inequalities by differential geometric methods, and we compare the obtained quantum speed limits with those involving the Bures length. We also characterize the Hamiltonians which optimize the evolution time for generic finite-level quantum systems. 1.Abstract. Inequalities of Mandelstam-Tamm and Margolus-Levitin type provide lower bounds on the time it takes for a quantum system to evolve from one state into another. Knowledge of such bounds, called quantum speed limits, is of utmost importance in virtually all areas of physics, where determination of the minimum time required for a quantum process is of interest. Most Mandelstam-Tamm and Margolus-Levitin inequalities found in the literature have been derived from growth estimates for the Bures length, which is a statistical distance measure. In this paper we derive such inequalities by differential geometric methods, and we compare the obtained quantum speed limits with those involving the Bures length. We also characterize the Hamiltonians which optimize the evolution time for generic finite-level quantum systems. 1.

Aug 15, 201633 citations

A tight quantum speed limit for mixed qubit states

Maja Eliasson

Quantum speed limits describe how fast a system can evolve from one state to another. There are several well-known quantum speed limits such as the Mandelstam–Tamm and Margolus–Levitin bounds which were originally derived for pure states and are not always tight for mixed states. In this thesis a stronger bound is derived for mixed qubit states, which has been shown to be tight, by using additional information about the system. We chose to focus on a single qubit and use the Bloch representation to describe its evolution geometrically. Due to both the energy and the purity of the system being conserved under unitary time evolution, the Bloch vector moves in a circle. By expressing the fidelity between the initial and final state in terms of Bloch vectors, we can derive a stricter quantum speed limit for mixed qubit states. This new lower bound depends on both fidelity and purity and is tighter than the Margolus–Levitin bound. The result shows that taking conserved quantities like purity into account can lead to improved quantum speed limits and similar ideas might be useful for more complex systems as well.Quantum speed limits describe how fast a system can evolve from one state to another. There are several well-known quantum speed limits such as the Mandelstam–Tamm and Margolus–Levitin bounds which were originally derived for pure states and are not always tight for mixed states. In this thesis a stronger bound is derived for mixed qubit states, which has been shown to be tight, by using additional information about the system. We chose to focus on a single qubit and use the Bloch representation to describe its evolution geometrically. Due to both the energy and the purity of the system being conserved under unitary time evolution, the Bloch vector moves in a circle. By expressing the fidelity between the initial and final state in terms of Bloch vectors, we can derive a stricter quantum speed limit for mixed qubit states. This new lower bound depends on both fidelity and purity and is tighter than the Margolus–Levitin bound. The result shows that taking conserved quantities like purity into account can lead to improved quantum speed limits and similar ideas might be useful for more complex systems as well.

Jan 1, 20260 citations

Testing the unified bounds of quantum speed limit

Yaozu Wu, Jiale Yuan, Chuanyu Zhang +12 more

Quantum speed limits (QSLs) impose fundamental constraints on the evolution speed of quantum systems. Traditionally, the Mandelstam-Tamm (MT) and Margolus-Levitin (ML) bounds have been widely employed, relying on the standard deviation and mean of energy distribution to define the QSLs. However, these universal bounds only offer loose restrictions on the quantum evolution. Here we introduce the generalized ML bounds, which prove to be more stringent in constraining dynamic evolution, by utilizing moments of energy spectra of arbitrary orders, even noninteger orders. To validate our findings, we conduct experiments in a superconducting circuit, where we have the capability to prepare a wide range of quantum photonic states and rigorously test these bounds by measuring the evolution of the system and its photon statistics using quantum state tomography. While, in general, the MT bound is effective for short-time evolution, we identify specific parameter regimes where either the MT or the generalized ML bounds suffice to constrain the entire evolution. Our findings not only establish new criteria for estimating QSLs but also substantially enhance our comprehension of the dynamic evolution of quantum systems.Quantum speed limits (QSLs) impose fundamental constraints on the evolution speed of quantum systems. Traditionally, the Mandelstam-Tamm (MT) and Margolus-Levitin (ML) bounds have been widely employed, relying on the standard deviation and mean of energy distribution to define the QSLs. However, these universal bounds only offer loose restrictions on the quantum evolution. Here we introduce the generalized ML bounds, which prove to be more stringent in constraining dynamic evolution, by utilizing moments of energy spectra of arbitrary orders, even noninteger orders. To validate our findings, we conduct experiments in a superconducting circuit, where we have the capability to prepare a wide range of quantum photonic states and rigorously test these bounds by measuring the evolution of the system and its photon statistics using quantum state tomography. While, in general, the MT bound is effective for short-time evolution, we identify specific parameter regimes where either the MT or the generalized ML bounds suffice to constrain the entire evolution. Our findings not only establish new criteria for estimating QSLs but also substantially enhance our comprehension of the dynamic evolution of quantum systems.

arXiv:2403.03579Mar 6, 20240 citations

Quantum speed limits and optimal Hamiltonians for driven systems in mixed states

O Andersson, Hoshang Heydari

Inequalities of Mandelstam–Tamm (MT) and Margolus–Levitin (ML) type provide lower bounds on the time that it takes for a quantum system to evolve from one state into another. Knowledge of such bounds, called quantum speed limits, is of utmost importance in virtually all areas of physics, where determination of the minimum time required for a quantum process is of interest. Most MT and ML inequalities found in the literature have been derived from growth estimates for the Bures length, which is a statistical distance measure. In this paper we derive such inequalities by differential geometric methods, and we compare the quantum speed limits obtained with those involving the Bures length. We also characterize the Hamiltonians which optimize the evolution time for generic finite-level quantum systems.Inequalities of Mandelstam–Tamm (MT) and Margolus–Levitin (ML) type provide lower bounds on the time that it takes for a quantum system to evolve from one state into another. Knowledge of such bounds, called quantum speed limits, is of utmost importance in virtually all areas of physics, where determination of the minimum time required for a quantum process is of interest. Most MT and ML inequalities found in the literature have been derived from growth estimates for the Bures length, which is a statistical distance measure. In this paper we derive such inequalities by differential geometric methods, and we compare the quantum speed limits obtained with those involving the Bures length. We also characterize the Hamiltonians which optimize the evolution time for generic finite-level quantum systems.

arXiv:1312.6268Journal of Physics A Mathematical and TheoreticalMay 7, 201452 citations

The Geometry of Speed Limiting Resources in Physical Models of Computation

Benjamin Russell, Susan Stepney

We study the maximum speed of quantum computation and how it is affected by limitations on physical resources. We show how the resulting concepts generalize to a broader class of physical models of computation within dynamical systems and introduce a specific algebraic structure representing these speed limits. We derive a family of quantum speed limit results in resource-constrained quantum systems with pure states and a finite dimensional state space, by using a geometric method based on right invariant action functionals on [Formula: see text]. We show that when the action functional is bi-invariant, the minimum time for implementing any quantum gate using a potentially time-dependent Hamiltonian is equal to the minimum time when using a constant Hamiltonian, thus constant Hamiltonians are time optimal for these constraints. We give an explicit formula for the time in these cases, in terms of the resource constraint. We show how our method produces a rich family of speed limit results, of which the generalized Margolus–Levitin theorem and the Mandelstam–Tamm inequality are special cases. We discuss the broader context of geometric approaches to speed limits in physical computation, including the way geometric approaches to quantum speed limits are a model for physical speed limits to computation arising from a limited resource.We study the maximum speed of quantum computation and how it is affected by limitations on physical resources. We show how the resulting concepts generalize to a broader class of physical models of computation within dynamical systems and introduce a specific algebraic structure representing these speed limits. We derive a family of quantum speed limit results in resource-constrained quantum systems with pure states and a finite dimensional state space, by using a geometric method based on right invariant action functionals on [Formula: see text]. We show that when the action functional is bi-invariant, the minimum time for implementing any quantum gate using a potentially time-dependent Hamiltonian is equal to the minimum time when using a constant Hamiltonian, thus constant Hamiltonians are time optimal for these constraints. We give an explicit formula for the time in these cases, in terms of the resource constraint. We show how our method produces a rich family of speed limit results, of which the generalized Margolus–Levitin theorem and the Mandelstam–Tamm inequality are special cases. We discuss the broader context of geometric approaches to speed limits in physical computation, including the way geometric approaches to quantum speed limits are a model for physical speed limits to computation arising from a limited resource.

arXiv:1611.09220International Journal of Foundations of Computer ScienceJun 1, 20177 citations

F(t) = \langle\omega|\rho(t)|\omega\rangle

to reach a prescribed discrimination threshold:

T \;\ge\; \frac{|\Theta(0) - \Theta_*|}{\Delta H_\omega},

where

\Theta = \arccos\sqrt{F}

is the Bures angle and

\Delta H_\omega

is the energy standard deviation of the \emph{fixed target state}. This bound, valid for both pure and mixed states under unitary dynamics, expresses the speed constraint in terms of a time-independent quantity determined entirely by the Hamiltonian and the detector projector, rather than the evolving-state variance appearing in standard Mandelstam--Tamm-type bounds. We further show that the resulting bound is structurally distinct from standard Mandelstam--Tamm-type bounds based on evolving-state variance. The bound exhibits commuting-sector invariance, suppressing Hamiltonian components that are energetically large but detection-irrelevant. Exact diagonalization of the transverse-field Ising model for

N \le 12

spins confirms asymptotic separation between the bounds in the strong-interaction regime. The framework provides a detector-conditioned lower bound for rank-1 projective detection dynamics, applicable to superconducting qubit readout, trapped-ion fluorescence detection, and stabilizer syndrome monitoring. The construction is particularly relevant for architectures in which experimentally accessible information is restricted to a small set of projective readout channels rather than full-state tomography. ## Results & Validation Below is the macro-level data extracted from the 156-qubit **ibm_fez** processor, confirming the asymptotic separation predicted by Theorem 5.2 as the many-body coupling strength scales extensively: [Quantum Speed Limit Validation Benchmark](qsl_validation_plot.png) ## Hardware Compilation Profile The transpiled circuit diagram below illustrates the native pulse-level gate routing on the IBM Quantum Heron architecture. By optimizing the physical register map, the compiler enforces a clean nearest-neighbor coupling loop with zero SWAP gate overhead: [Heron Chip Circuit Native Compilation](circuit-d8uhclsbp3hs73861d7g.png) ## Raw Measurement Diagnostics To evaluate the projective fidelity reduction threshold (

F_* = 0.15

), raw binary distributions are unpacked and corrected using Matrix-Free Measurement Mitigation (M3). Below is a representative diagnostic histogram of single-outcome state frequencies sampled from the hardware backend: [Error Mitigated Hardware Measurement Histogram](job_d8uhc4ctqbtc73d1qdmg_results_c.png)