Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics A Mathematical and General

The adiabatic analogue of the Margolus–Levitin theorem

M. Andrecut, Mazhar Ali

Published Mar 29, 2004• 24 citations
Publisher

Abstract

In this letter we derive the minimum time needed for any state of a given quantum system to evolve adiabatically into a distinct (orthogonal) state. This problem is relevant to deriving physical limits in quantum computation and quantum information processing. Our result represents an adiabatic analogue to the Margolus–Levitin theorem (Margolus and Levitin 1998 Physica D 120 , 188).

DOI
10.1088/0305-4470/37/15/l01

Related papers

Covariant versions of Margolus-Levitin Theorem

Qiao-jun Cao, Yi-Xin Chen, Jianlong Li

The Margolus-Levitin Theorem is a limitation on the minimal evolving time of a quantum system from its initial state to its orthogonal state. It also supplies a bound on the maximal operations or events can occur within a volume of spacetime. We compare Margolus-Levitin Theorem with other form of limitation on minimal evolving time, and present covariant versions of Margolus-Levitin Theorem in special and general relativity respectively. The relation among entropy bound, maximum information flow and computational limit are discussed, by applying the covariant versions of Margolus-Levitin Theorem.

arXiv:0805.4250•May 28, 2008•4 citations

Fast quantum computation at arbitrarily low energy

Stephen P. Jordan

One version of the energy-time uncertainty principle states that the minimum time ${T}_{\ensuremath{\perp}}$ for a quantum system to evolve from a given state to any orthogonal state is $h/(4\mathrm{\ensuremath{\Delta}}E)$, where $\mathrm{\ensuremath{\Delta}}E$ is the energy uncertainty. A related bound called the Margolus-Levitin theorem states that ${T}_{\ensuremath{\perp}}\ensuremath{\ge}h/(2\ensuremath{\langle}E\ensuremath{\rangle})$, where $\ensuremath{\langle}E\ensuremath{\rangle}$ is the expectation value of energy and the ground energy is taken to be zero. Many subsequent works have interpreted ${T}_{\ensuremath{\perp}}$ as defining a minimal time for an elementary computational operation and correspondingly a fundamental limit on clock speed determined by a system's energy. Here we present local time-independent Hamiltonians in which computational clock speed becomes arbitrarily large relative to $\ensuremath{\langle}E\ensuremath{\rangle}$ and $\mathrm{\ensuremath{\Delta}}E$ as the number of computational steps goes to infinity. We argue that energy considerations alone are not sufficient to obtain an upper bound on computational speed, and that additional physical assumptions such as limits to information density and information transmission speed are necessary to obtain such a bound.

arXiv:1701.01175•Physical Review A•Mar 6, 2017•42 citations

Generalization of the Margolus-Levitin bound

Bartosz Zieliński, Magdalena Zych

The Margolus-Levitin lower bound on the minimal time required for a state to be transformed into an orthogonal state is generalized. It is shown that for some initial states the new bound is stronger than the Margolus-Levitin one.

arXiv:quant-ph/0603076•Physical Review A•Sep 11, 2006•52 citations

α>(ε)=α<(ε) for the Margolus-Levitin quantum speed limit bound

H. F. Chau

The Margolus-Levitin (ML) bound says that for any time-independent Hamiltonian, the time needed to evolve from one quantum state to another is at least $\ensuremath{\pi}\ensuremath{\alpha}(\ensuremath{\epsilon})/2\ensuremath{\langle}E\ensuremath{-}{E}_{0}\ensuremath{\rangle}$, where $\ensuremath{\langle}E\ensuremath{-}{E}_{0}\ensuremath{\rangle}$ is the expected energy of the system relative to the ground state of the Hamiltonian and $\ensuremath{\alpha}(\ensuremath{\epsilon})$ is a function of the fidelity $\ensuremath{\epsilon}$ between the two states. For a long time, only an upper bound ${\ensuremath{\alpha}}_{>}(\ensuremath{\epsilon})$ and a lower bound ${\ensuremath{\alpha}}_{<}(\ensuremath{\epsilon})$ are known, although they agree up to at least seven significant figures. Recently, H\"ornedal and S\"onnerborn [arXiv:2301.10063] proved an analytical expression for $\ensuremath{\alpha}(\ensuremath{\epsilon})$, a fully classified system whose evolution time saturates the ML bound, and gave this bound a symplectic-geometric interpretation. Here I solve the same problem through an elementary proof of the ML bound. By explicitly finding all the states that saturate the ML bound, I show that ${\ensuremath{\alpha}}_{>}(\ensuremath{\epsilon})$ is indeed equal to ${\ensuremath{\alpha}}_{<}(\ensuremath{\epsilon})$. More importantly, I point out a numerical stability issue in computing ${\ensuremath{\alpha}}_{>}(\ensuremath{\epsilon})$ and report a simple way to evaluate it efficiently and accurately.

arXiv:2305.10101•Physical Review A•Nov 1, 2023•4 citations

On the orthogonalization of quantum states

Yong Xiao, Guang Yang

Some quantum states can dynamically evolve to an orthogonal state after a time interval, while some states can never evolve to their orthogonal states. In this paper, we investigate three issues on the orthogonalization properties of quantum states. First, we answer the question as to under what conditions an initial state can evolve to an orthogonal state. Second, we discuss the orthogonalization rate of quantum states, i.e. , the total number of orthogonal states that the evolution can go through in unit time. Finally, we show that the Margolus-Levitin bound for orthogonalization time remains tight for superpositions of more than two eigenstates.

Europhysics Letters (EPL)•Jul 1, 2013•1 citation

The Margolus-Levitin Bound and Energy-Time Limits for Quantum Computation at the Landauer Scale

Rowan Brad Quni-Gudzinas

The Margolus-Levitin (ML) bound establishes a fundamental limit on the speed of quantum evolution, stating that a system with mean energy $\langle H \rangle$ above its ground state requires a minimum time $\tau \ge \pi\hbar/(2\langle H\rangle)$ to evolve between orthogonal states. This preprint rigorously derives the ML bound and critically examines its applicability as a universal per-operation energy-time limit for quantum computation at the Landauer-relevant energy scale. We show that while the ML bound constrains the intrinsic dynamics of the qubit register, it does not account for the dominant energy dissipation from cryogenic control hardware. Consequently, the ML bound alone is insufficient to characterize the energy cost of a logical operation. To address this, we connect the theoretical limit to the QNFO joules-per-compute (JPCUB) benchmark program and propose a concrete normalization of computational cost. This normalization quantifies energy per logical qubit operation by incorporating both the intrinsic qubit energy and the overhead of cryogenic controllers, providing a practical metric for quantum computation efficiency. ## 1. Introduction Quantum speed limits (QSLs) bound the minimum time required for a quantum state to evolve to an orthogonal state. The Margolus-Levitin (ML) bound is a prominent QSL, relating this minimum time to the mean energy of the system. As quantum computing hardware matures, understanding the fundamental energy limits of computation becomes critical. The Landauer limit sets a lower bound on the energy dissipated by irreversible operations, while the ML bound sets a lower bound on the time required for state evolution. This preprint derives the ML bound and assesses its role as a universal per-operation energy-time bound for quantum computation. We then connect this theoretical limit to the QNFO joules-per-compute (JPCUB) benchmark program, proposing a concrete normalization for the energy cost of logical qubit operations in cr

•Sep 4, 2026•0 citations
In this letter we derive the minimum time needed for any state of a given quantum system to evolve adiabatically into a distinct (orthogonal) state. This problem is relevant to deriving physical limits in quantum computation and quantum information processing. Our result represents an adiabatic analogue to the Margolus–Levitin theorem (Margolus and Levitin 1998 Physica D 120 , 188).
The Margolus-Levitin Theorem is a limitation on the minimal evolving time of a quantum system from its initial state to its orthogonal state. It also supplies a bound on the maximal operations or events can occur within a volume of spacetime. We compare Margolus-Levitin Theorem with other form of limitation on minimal evolving time, and present covariant versions of Margolus-Levitin Theorem in special and general relativity respectively. The relation among entropy bound, maximum information flow and computational limit are discussed, by applying the covariant versions of Margolus-Levitin Theorem.
One version of the energy-time uncertainty principle states that the minimum time ${T}_{\ensuremath{\perp}}$ for a quantum system to evolve from a given state to any orthogonal state is $h/(4\mathrm{\ensuremath{\Delta}}E)$, where $\mathrm{\ensuremath{\Delta}}E$ is the energy uncertainty. A related bound called the Margolus-Levitin theorem states that ${T}_{\ensuremath{\perp}}\ensuremath{\ge}h/(2\ensuremath{\langle}E\ensuremath{\rangle})$, where $\ensuremath{\langle}E\ensuremath{\rangle}$ is the expectation value of energy and the ground energy is taken to be zero. Many subsequent works have interpreted ${T}_{\ensuremath{\perp}}$ as defining a minimal time for an elementary computational operation and correspondingly a fundamental limit on clock speed determined by a system's energy. Here we present local time-independent Hamiltonians in which computational clock speed becomes arbitrarily large relative to $\ensuremath{\langle}E\ensuremath{\rangle}$ and $\mathrm{\ensuremath{\Delta}}E$ as the number of computational steps goes to infinity. We argue that energy considerations alone are not sufficient to obtain an upper bound on computational speed, and that additional physical assumptions such as limits to information density and information transmission speed are necessary to obtain such a bound.
The Margolus-Levitin (ML) bound says that for any time-independent Hamiltonian, the time needed to evolve from one quantum state to another is at least $\ensuremath{\pi}\ensuremath{\alpha}(\ensuremath{\epsilon})/2\ensuremath{\langle}E\ensuremath{-}{E}_{0}\ensuremath{\rangle}$, where $\ensuremath{\langle}E\ensuremath{-}{E}_{0}\ensuremath{\rangle}$ is the expected energy of the system relative to the ground state of the Hamiltonian and $\ensuremath{\alpha}(\ensuremath{\epsilon})$ is a function of the fidelity $\ensuremath{\epsilon}$ between the two states. For a long time, only an upper bound ${\ensuremath{\alpha}}_{>}(\ensuremath{\epsilon})$ and a lower bound ${\ensuremath{\alpha}}_{<}(\ensuremath{\epsilon})$ are known, although they agree up to at least seven significant figures. Recently, H\"ornedal and S\"onnerborn [arXiv:2301.10063] proved an analytical expression for $\ensuremath{\alpha}(\ensuremath{\epsilon})$, a fully classified system whose evolution time saturates the ML bound, and gave this bound a symplectic-geometric interpretation. Here I solve the same problem through an elementary proof of the ML bound. By explicitly finding all the states that saturate the ML bound, I show that ${\ensuremath{\alpha}}_{>}(\ensuremath{\epsilon})$ is indeed equal to ${\ensuremath{\alpha}}_{<}(\ensuremath{\epsilon})$. More importantly, I point out a numerical stability issue in computing ${\ensuremath{\alpha}}_{>}(\ensuremath{\epsilon})$ and report a simple way to evaluate it efficiently and accurately.
Some quantum states can dynamically evolve to an orthogonal state after a time interval, while some states can never evolve to their orthogonal states. In this paper, we investigate three issues on the orthogonalization properties of quantum states. First, we answer the question as to under what conditions an initial state can evolve to an orthogonal state. Second, we discuss the orthogonalization rate of quantum states, i.e. , the total number of orthogonal states that the evolution can go through in unit time. Finally, we show that the Margolus-Levitin bound for orthogonalization time remains tight for superpositions of more than two eigenstates.
The Margolus-Levitin (ML) bound establishes a fundamental limit on the speed of quantum evolution, stating that a system with mean energy ⟨H⟩\langle H \rangle⟨H⟩ above its ground state requires a minimum time τ≥πℏ/(2⟨H⟩)\tau \ge \pi\hbar/(2\langle H\rangle)τ≥πℏ/(2⟨H⟩) to evolve between orthogonal states. This preprint rigorously derives the ML bound and critically examines its applicability as a universal per-operation energy-time limit for quantum computation at the Landauer-relevant energy scale. We show that while the ML bound constrains the intrinsic dynamics of the qubit register, it does not account for the dominant energy dissipation from cryogenic control hardware. Consequently, the ML bound alone is insufficient to characterize the energy cost of a logical operation. To address this, we connect the theoretical limit to the QNFO joules-per-compute (JPCUB) benchmark program and propose a concrete normalization of computational cost. This normalization quantifies energy per logical qubit operation by incorporating both the intrinsic qubit energy and the overhead of cryogenic controllers, providing a practical metric for quantum computation efficiency. ## 1. Introduction Quantum speed limits (QSLs) bound the minimum time required for a quantum state to evolve to an orthogonal state. The Margolus-Levitin (ML) bound is a prominent QSL, relating this minimum time to the mean energy of the system. As quantum computing hardware matures, understanding the fundamental energy limits of computation becomes critical. The Landauer limit sets a lower bound on the energy dissipated by irreversible operations, while the ML bound sets a lower bound on the time required for state evolution. This preprint derives the ML bound and assesses its role as a universal per-operation energy-time bound for quantum computation. We then connect this theoretical limit to the QNFO joules-per-compute (JPCUB) benchmark program, proposing a concrete normalization for the energy cost of logical qubit operations in cr