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

arXiv:0706.3653 · International Journal of Theoretical Physics

Lower Bound of Minimal Time Evolution in Quantum Mechanics

Pulak Ranjan Giri

Published Jan 15, 2008• 11 citations
arXivHTMLPDF
DOI
10.1007/s10773-008-9650-0

Related papers

Time Evolution in Quantum Mechanics

CRC Press eBooks•Sep 25, 2009•0 citations

Quantum Speed Limit for Physical Processes

Márcio M. Taddei, Bruno M. Escher, L. Davidovich +1 more

The evaluation of the minimal evolution time between two distinguishable states of a system is important for assessing the maximal speed of quantum computers and communication channels. Lower bounds for this minimal time have been proposed for unitary dynamics. Here we show that it is possible to extend this concept to nonunitary processes, using an attainable lower bound that is connected to the quantum Fisher information for time estimation. This result is used to delimit the minimal evolution time for typical noisy channels.

arXiv:1209.0362•Physical Review Letters•Jan 30, 2013•508 citations

The thermodynamics of time

Dries Sels, Michiel Wouters

The problem of time is a deep paradox in our physical description of the world. According to Aristotle's relational theory, time is a measure of change and does not exist on its own. In contrast, quantum mechanics, just like Newtonian mechanics, is equipped with a master clock that dictates the evolution of a system. This clock is infinitely precise and tacitly supplied free of charge from outside physics. Not only does this absolute time make it notoriously difficult to make a consistent theory of quantum gravity, it is also the underlying problem in establishing the second law. Indeed, contrary to our experience, the Wheeler-deWitt equation --a canonical quantization of general relativity-- predicts a static universe. Similarly, when simply concerned with the dynamics of a closed quantum system, there is no second law because the Von Neumann entropy is invariant under unitary transformations. Here we are mainly concerned with the latter problem and we show that it can be resolved by attributing a minimal amount of resources to the measurement of time. Although there is an absolute time in quantum mechanics, an observer can only establish a time by measuring a clock. For a local measurement, the minimal entropy production is equal to the number of ticks. This lower bound is attained by a black hole.

arXiv:1501.05567•Jan 22, 2015•5 citations

Foundations of time evolution in quantum mechanics

Bernhard Baumgartner

International Journal of Theoretical Physics•Aug 1, 1995•1 citation

Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity

Paweł Wocjan, Dominik Janzing, T. Beth

We consider a quantum computer consisting of n spins with an arbitrary but fixed pair-interaction Hamiltonian and describe how to simulate other pair-interactions by interspersing the natural time evolution with fast local transformations. Calculating the minimal time overhead of such a simulation leads to a convex optimization problem. Lower and upper bounds on the minimal time overhead are derived in terms of chromatic indices of interaction graphs and spectral majorization criteria. These results classify Hamiltonians with respect to their computational power. For a specific Hamiltonian, namely \sigma_z\otimes\sigma_z-interactions between all spins, the optimization is mathematically equivalent to a separability problem of n-qubit density matrices. We compare the complexity defined by such a quantum computer with the usual gate complexity.

arXiv:quant-ph/0106077•Quantum Information and Computation•Feb 1, 2002•38 citations

Time evolution of quantum systems

Series in atomic and molecular physics/Series in atomic molecular physics•Dec 1, 2003•0 citations
The evaluation of the minimal evolution time between two distinguishable states of a system is important for assessing the maximal speed of quantum computers and communication channels. Lower bounds for this minimal time have been proposed for unitary dynamics. Here we show that it is possible to extend this concept to nonunitary processes, using an attainable lower bound that is connected to the quantum Fisher information for time estimation. This result is used to delimit the minimal evolution time for typical noisy channels.
The problem of time is a deep paradox in our physical description of the world. According to Aristotle's relational theory, time is a measure of change and does not exist on its own. In contrast, quantum mechanics, just like Newtonian mechanics, is equipped with a master clock that dictates the evolution of a system. This clock is infinitely precise and tacitly supplied free of charge from outside physics. Not only does this absolute time make it notoriously difficult to make a consistent theory of quantum gravity, it is also the underlying problem in establishing the second law. Indeed, contrary to our experience, the Wheeler-deWitt equation --a canonical quantization of general relativity-- predicts a static universe. Similarly, when simply concerned with the dynamics of a closed quantum system, there is no second law because the Von Neumann entropy is invariant under unitary transformations. Here we are mainly concerned with the latter problem and we show that it can be resolved by attributing a minimal amount of resources to the measurement of time. Although there is an absolute time in quantum mechanics, an observer can only establish a time by measuring a clock. For a local measurement, the minimal entropy production is equal to the number of ticks. This lower bound is attained by a black hole.
We consider a quantum computer consisting of n spins with an arbitrary but fixed pair-interaction Hamiltonian and describe how to simulate other pair-interactions by interspersing the natural time evolution with fast local transformations. Calculating the minimal time overhead of such a simulation leads to a convex optimization problem. Lower and upper bounds on the minimal time overhead are derived in terms of chromatic indices of interaction graphs and spectral majorization criteria. These results classify Hamiltonians with respect to their computational power. For a specific Hamiltonian, namely \sigma_z\otimes\sigma_z-interactions between all spins, the optimization is mathematically equivalent to a separability problem of n-qubit density matrices. We compare the complexity defined by such a quantum computer with the usual gate complexity.