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:1409.3204 · Physical Review Letters

Solution to the Quantum Zermelo Navigation Problem

Dorje C. Brody, David M. Meier

Published Mar 11, 2015• 57 citations
arXivHTMLPDF

Abstract

The solution to the problem of finding a time-optimal control Hamiltonian to generate a given unitary gate, in an environment in which there exists an uncontrollable ambient Hamiltonian (e.g., a background field), is obtained. In the classical context, finding the time-optimal way to steer a ship in the presence of a background wind or current is known as the Zermelo navigation problem, whose solution can be obtained by working out geodesic curves on a space equipped with a Randers metric. The solution to the quantum Zermelo problem, which is shown here to take a remarkably simple form, is likewise obtained by finding explicit solutions to the geodesic equations of motion associated with a Randers metric on the space of unitary operators. The result reveals that the optimal control in a sense "goes along with the wind."

DOI
10.1103/physrevlett.114.100502

Related papers

Zermelo navigation in the quantum brachistochrone

Benjamin Russell, Susan Stepney

Abstract We analyse the optimal times for implementing unitary quantum gates in a constrained finite dimensional controlled quantum system. The family of constraints studied is that the permitted set of (time dependent) Hamiltonians is the unit ball of a norm induced by an inner product on . We also consider a generalization of this to arbitrary norms. We construct a Randers metric, by applying a theorem of Shen on Zermelo navigation, the geodesics of which are the time optimal trajectories compatible with the prescribed constraint. We determine all geodesics and the corresponding time optimal Hamiltonian for a specific constraint on the control i.e. for any given value of . Some of the results of Carlini et al are re-derived using alternative methods. A first order system of differential equations for the optimal Hamiltonian is obtained and shown to be of the form of the Euler–Poincaré equations. We illustrate that this method can form a methodology for determining which physical substrates are effective at supporting the implementation of fast quantum computation.

arXiv:1409.2055•Journal of Physics A Mathematical and Theoretical•Feb 23, 2015•49 citations

Zermelo navigation for quantum states

Dorje C. Brody, Gary William Gibbons, David M. Meier

The quantum navigation problem of finding the time-optimal control Hamiltonian that transports a given initial state to a target state through quantum wind, that is, under the influence of external fields or potentials, is analysed. By lifting the problem from the state space to the space of unitary gates realising the required task, we are able to deduce the form of the solution to the problem by deriving a universal quantum speed limit. The expression thus obtained indicates that further simplifications of this apparently difficult problem are possible if we switch to the interaction picture of quantum mechanics. A complete solution to the navigation problem for an arbitrary quantum system is then obtained, and the behaviour of the solution is illustrated in the case of a two-level system.

•Oct 24, 2014•0 citations

Zermelo navigation and a speed limit to quantum information processing

Benjamin Russell, Susan Stepney

We use a specific geometric method to determine speed limits for the implementation of quantum gates in controlled quantum systems that have a specific class of constrained control functions. We achieve this by applying a recent theorem of Shen, which provides a connection between time optimal navigation on Riemannian manifolds and the geodesics of a certain Finsler metric of Randers type. We use the lengths of these geodesics to derive the optimal implementation times (under the assumption of constant control fields) for an arbitrary quantum operation (on a finite dimensional Hilbert space), and explicitly calculate the result for the case of a controlled single spin system in a magnetic field and a swap gate in a Heisenberg spin chain.

arXiv:1310.6731•Physical Review A•Jul 2, 2014•69 citations

Time-optimal navigation through quantum wind

Dorje C. Brody, Gary William Gibbons, David M. Meier

The quantum navigation problem of finding the time-optimal control Hamiltonian that transports a given initial state to a target state through quantum wind, that is, under the influence of external fields or potentials, is analyzed. By lifting the problem from the state space to the space of unitary gates realizing the required task, we are able to deduce the form of the solution to the problem by deriving a universal quantum speed limit. The expression thus obtained indicates that further simplifications of this apparently difficult problem are possible if we switch to the interaction picture of quantum mechanics. A complete solution to the navigation problem for an arbitrary quantum system is then obtained, and the behaviour of the solution is illustrated in the case of a two-level system.

arXiv:1410.6724•New Journal of Physics•Mar 31, 2015•53 citations

Zermelo's navigation problem through the lens of quantum annealing: How the Landau-Zener approximation leads to an efficient classical solution

Sølve Selstø, Tor Kristian Dahle, Sergiy Denysov +2 more

The river-crossing problem, also known as Zermelo's navigation problem, is a classic example of an optimization problem with practical relevance and a scalable degree of complexity. It asks for the optimal trajectory of a vessel moving through a water flow field and provides a setting in which physics, variational methods, and optimization are naturally intertwined. We state a version of Zermelo's problem and then solve it as formulate it as an adiabatic quantum-computing problem using quantum trits, or qutrits for short. The construction includes a penalty term that enforces the prescribed boundary conditions and an exploration term that allows the system to move through intermediate configurations toward the optimal feasible path. In the adiabatic description, the evolution proceeds through a sequence of avoided crossings, so that the resulting fidelity can be estimated using the Landau-Zener formula. Remarkably, the regime in which this approximation is valid also provides a deterministic way to identify the correct solution with computational effort that scales only quadratically with the problem size. Thus, a quantum formulation initially motivated by the apparent exponential complexity of the problem reveals an underlying classical structure that can be exploited efficiently. Our approach also provides a pedagogical illustration of how a real-world optimization problem can be cast into a quantum-annealing framework and then analyzed using the Schrödinger equation, avoided crossings, and Landau-Zener theory.

quant-pharXiv:2606.09602•Jun 9, 2026•0 citations

Time-optimal bath-induced unitaries by Zermelo navigation: speed limit and non-Markovian quantum computation

Clausen, Jens

The solution of the quantum Zermelo navigation problem is applied to the non-Markovian open system dynamics of a set of quantum systems interacting with a common environment. We consider a case allowing an exact time-optimal realization of environment-mediated non-local system unitaries. For a linear coupling to a harmonic bosonic bath, we derive a speed limit for the implementation time in terms of the fundamental frequency of the bath modes. As a product of two exponentials of the local free wind and the pairwise system-coupling, the Zermelo unitary forms a natural building block for reaching a general unitary by concatenation.

arXiv:1507.08990•Jul 31, 2015•1 citation
The solution to the problem of finding a time-optimal control Hamiltonian to generate a given unitary gate, in an environment in which there exists an uncontrollable ambient Hamiltonian (e.g., a background field), is obtained. In the classical context, finding the time-optimal way to steer a ship in the presence of a background wind or current is known as the Zermelo navigation problem, whose solution can be obtained by working out geodesic curves on a space equipped with a Randers metric. The solution to the quantum Zermelo problem, which is shown here to take a remarkably simple form, is likewise obtained by finding explicit solutions to the geodesic equations of motion associated with a Randers metric on the space of unitary operators. The result reveals that the optimal control in a sense "goes along with the wind."
Abstract We analyse the optimal times for implementing unitary quantum gates in a constrained finite dimensional controlled quantum system. The family of constraints studied is that the permitted set of (time dependent) Hamiltonians is the unit ball of a norm induced by an inner product on . We also consider a generalization of this to arbitrary norms. We construct a Randers metric, by applying a theorem of Shen on Zermelo navigation, the geodesics of which are the time optimal trajectories compatible with the prescribed constraint. We determine all geodesics and the corresponding time optimal Hamiltonian for a specific constraint on the control i.e. for any given value of . Some of the results of Carlini et al are re-derived using alternative methods. A first order system of differential equations for the optimal Hamiltonian is obtained and shown to be of the form of the Euler–Poincaré equations. We illustrate that this method can form a methodology for determining which physical substrates are effective at supporting the implementation of fast quantum computation.
The quantum navigation problem of finding the time-optimal control Hamiltonian that transports a given initial state to a target state through quantum wind, that is, under the influence of external fields or potentials, is analysed. By lifting the problem from the state space to the space of unitary gates realising the required task, we are able to deduce the form of the solution to the problem by deriving a universal quantum speed limit. The expression thus obtained indicates that further simplifications of this apparently difficult problem are possible if we switch to the interaction picture of quantum mechanics. A complete solution to the navigation problem for an arbitrary quantum system is then obtained, and the behaviour of the solution is illustrated in the case of a two-level system.
We use a specific geometric method to determine speed limits for the implementation of quantum gates in controlled quantum systems that have a specific class of constrained control functions. We achieve this by applying a recent theorem of Shen, which provides a connection between time optimal navigation on Riemannian manifolds and the geodesics of a certain Finsler metric of Randers type. We use the lengths of these geodesics to derive the optimal implementation times (under the assumption of constant control fields) for an arbitrary quantum operation (on a finite dimensional Hilbert space), and explicitly calculate the result for the case of a controlled single spin system in a magnetic field and a swap gate in a Heisenberg spin chain.
The quantum navigation problem of finding the time-optimal control Hamiltonian that transports a given initial state to a target state through quantum wind, that is, under the influence of external fields or potentials, is analyzed. By lifting the problem from the state space to the space of unitary gates realizing the required task, we are able to deduce the form of the solution to the problem by deriving a universal quantum speed limit. The expression thus obtained indicates that further simplifications of this apparently difficult problem are possible if we switch to the interaction picture of quantum mechanics. A complete solution to the navigation problem for an arbitrary quantum system is then obtained, and the behaviour of the solution is illustrated in the case of a two-level system.
The river-crossing problem, also known as Zermelo's navigation problem, is a classic example of an optimization problem with practical relevance and a scalable degree of complexity. It asks for the optimal trajectory of a vessel moving through a water flow field and provides a setting in which physics, variational methods, and optimization are naturally intertwined. We state a version of Zermelo's problem and then solve it as formulate it as an adiabatic quantum-computing problem using quantum trits, or qutrits for short. The construction includes a penalty term that enforces the prescribed boundary conditions and an exploration term that allows the system to move through intermediate configurations toward the optimal feasible path. In the adiabatic description, the evolution proceeds through a sequence of avoided crossings, so that the resulting fidelity can be estimated using the Landau-Zener formula. Remarkably, the regime in which this approximation is valid also provides a deterministic way to identify the correct solution with computational effort that scales only quadratically with the problem size. Thus, a quantum formulation initially motivated by the apparent exponential complexity of the problem reveals an underlying classical structure that can be exploited efficiently. Our approach also provides a pedagogical illustration of how a real-world optimization problem can be cast into a quantum-annealing framework and then analyzed using the Schrödinger equation, avoided crossings, and Landau-Zener theory.
The solution of the quantum Zermelo navigation problem is applied to the non-Markovian open system dynamics of a set of quantum systems interacting with a common environment. We consider a case allowing an exact time-optimal realization of environment-mediated non-local system unitaries. For a linear coupling to a harmonic bosonic bath, we derive a speed limit for the implementation time in terms of the fundamental frequency of the bath modes. As a product of two exponentials of the local free wind and the pairwise system-coupling, the Zermelo unitary forms a natural building block for reaching a general unitary by concatenation.