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

Optimized Quantum State Transitions

Robbert W. Scholtens

Published Jul 20, 2018• 0 citations
OpenAlex

Abstract

The quantum brachistochrone problem -- to find the time-optimal transition between given initial and final quantum states -- is investigated in this bachelor's thesis. First the quantum equivalent of distance (the Fubini-Study metric) is formulated, using geometry of spheres. Together with constraints, it is used to create the quantum action. Functional derivatives are then taken of said action to find equations of motion (eoms). For the unconstrained case (excluding finite energy), these eoms are solved in closed form, whilst general to be solved formulae are obtained for the constrained case. The latter is used to explicitly solve an example quantum brachistochrone problem: a spin-1/2 particle in a controllable magnetic field constrained to an x-y plane. Finally, the link with quantum computing is illustrated through the time-optimization of unitary transformations that the quantum brachistochrone yields us.

Related papers

最速量子操作

陽介 奥平, Yosuke Okudaira

We present a general framework for finding the time-optimal quantum evolution inspired by the classical problem called the brachistochrone problem.At first, the time-optimal control problem for achieving a pure state evolution from a given initial state to a desired final state is formulated.We minimize the duration time for this transition by finding the optimal control for the Hamiltonian in an available set subject to a certain constraint dictated by physical conditions.Then, it will be extended to the unitary evolution which has greater relevance for quantum computation.This provides a systematic way to make an efficient unitary gate on a certain physical system.To demonstrate this framework, we choose the anisotropic Heisenberg model and find a general solution.Since it is not always possible to find a general solution for the fundamental equation for the time-optimal control, we introduce the simulated annealing method as a simple numerical method to show that our framework can be used for the system whose general solution cannot be found.The numerical analysis based on the Krotov iteration method is introduced and applied to the time-optimal quantum control problem to solve the problem efficiently.The optimal realization of the quantum Fourier transform for two or more qubit systems are derived.We consider two generalizations of the quantum brachistochrone for mixed state evolutions.One is the unitary evolution with ancilla system ended up with the final measurement on the ancilla.The other is the repetition of measurement or decoherence model which can be represented by the evolution with the master equation in the Lindblad form.Also, the relation between the fidelity to the target and the duration time is considerd.A.4 Quantum speed limit . . . . . . . . .

•Mar 1, 2008•0 citations

Minimum-Time Quantum Control and the Quantum Brachistochrone Equation

Jing Yang, Adolfo del Campo

Minimum-time quantum control protocols can be obtained from the quantum brachistochrone formalism [Carlini, Hosoya, Koike, and Okudaira, Phys. Rev. Lett. 96, 06053, (2006)]. We point out that the original treatment implicitly applied the variational calculus with fixed boundary conditions. We argue that the genuine quantum brachistochrone problem involves a variational problem with a movable endpoint, contrary to the classical brachistochrone problem. This formulation not only simplifies the derivation of the quantum brachistochrone equation but introduces an additional constraint at the endpoint due to the boundary effect. We present the general solution to the full quantum brachistochrone equation and discuss its main features. Using it, we prove that the speed of evolution under constraints is reduced with respect to the unrestricted case. In addition, we find that solving the quantum brachistochrone equation is closely connected to solving the dynamics of the Lagrange multipliers, which is in general governed by nonlinear differential equations. Their numerical integration allows generating time-extremal trajectories. Furthermore, when the restricted operators form a closed subalgebra, the Lagrange multipliers become constant and the optimal Hamiltonian takes a concise form. The new class of analytically solvable models for the quantum brachistochrone problem opens up the possibility of applying it to many-body quantum systems, exploring notions related to geometry such as quantum speed limits, and advancing significantly the quantum state and gate preparation for quantum information processing.

arXiv:2204.12792•Apr 27, 2022•2 citations

Quantum Brachistochrone Curves as Geodesics: Obtaining Accurate Minimum-Time Protocols for the Control of Quantum Systems

Xiaoting Wang, Michele Allegra, Kurt A. Jacobs +3 more

Most methods of optimal control cannot obtain accurate time-optimal protocols. The quantum brachistochrone equation is an exception, and has the potential to provide accurate time-optimal protocols for a wide range of quantum control problems. So far, this potential has not been realized, however, due to the inadequacy of conventional numerical methods to solve it. Here we show that the quantum brachistochrone problem can be recast as that of finding geodesic paths in the space of unitary operators. We expect this brachistochrone-geodesic connection to have broad applications, as it opens up minimal-time control to the tools of geometry. As one such application, we use it to obtain a fast numerical method to solve the brachistochrone problem, and apply this method to two examples demonstrating its power.

arXiv:1408.2465•Physical Review Letters•Apr 28, 2015•111 citations

Quantum brachistochrone problem for a spin-1 system in a magnetic field

Andrzej Frydryszak, V. M. Tkachuk

We study the quantum brachistochrone problem for a spin-1 system in a magnetic field of constant absolute value. Such a system gives us the possibility to examine in detail the statement that the state vectors realizing evolution with the minimal time of passage evolve along the subspace spanned by the initial and final state vectors [Carlini et al., Phys. Rev. Lett. 96, 060503 (2006); Brody and Hook, J. Phys. A 39, L167 (2006)]. Considering an explicit example, we show the existence of a quantum brachistochrone with the minimal possible time; however, the state vector we study leaves the subspace spanned by the initial and final state vectors during evolution. This is the result of our choice of a more constrained Hamiltonian than the one assumed in the general quantum brachistochrone problem. It is worth noting that such an evolution, being more complicated, is time optimal but with larger time than in the general case. This might be important for experiments, where a general Hamiltonian with all the allowed parameters is difficult to implement, but a constrained one, depending on the magnetic field, can be realized. However, for the preconstrained Hamiltonian not all final states are accessible. The present result does not contradict the general statement of the quantum brachistochrone problem, but gives additional insight into possible realization of the time-optimal passage.

arXiv:0709.0931•Physical Review A•Jan 15, 2008•31 citations

Algorithm for solving unconstrained unitary quantum brachistochrone problems

Francesco Campaioli, William Sloan, Kavan Kishore Modi +1 more

The quantum brachistochrone problem (QBP) aims to find the optimal map steering a quantum system from a given initial state to a given final state in the minimum time, related to the quantum speed limit. An iterative method is introduced to solve the unconstrained, unitary QBP for mixed states. It could be interesting for quantum control applications.

arXiv:1906.02934•Physical Review A•Dec 20, 2019•21 citations

Time-optimal quantum control via differential geometry

Xiaoting Wang, Michele Allegra, Kurt A. Jacobs +3 more

Compared with many other methods which only give time sub-optimal designs, the quantum brachistochrone equation has a great potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far it has been of limited use, however, due to the inadequacy of conventional numerical methods to solve it. Here, using differential geometry, we reformulate the quantum brachistochrone curves as geodesics on the unitary group. This identification allows us to design a numerical method that can efficiently solve the brachistochrone problem by first solving a family of geodesic equations.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 20, 2017•4 citations
The quantum brachistochrone problem -- to find the time-optimal transition between given initial and final quantum states -- is investigated in this bachelor's thesis. First the quantum equivalent of distance (the Fubini-Study metric) is formulated, using geometry of spheres. Together with constraints, it is used to create the quantum action. Functional derivatives are then taken of said action to find equations of motion (eoms). For the unconstrained case (excluding finite energy), these eoms are solved in closed form, whilst general to be solved formulae are obtained for the constrained case. The latter is used to explicitly solve an example quantum brachistochrone problem: a spin-1/2 particle in a controllable magnetic field constrained to an x-y plane. Finally, the link with quantum computing is illustrated through the time-optimization of unitary transformations that the quantum brachistochrone yields us.
We present a general framework for finding the time-optimal quantum evolution inspired by the classical problem called the brachistochrone problem.At first, the time-optimal control problem for achieving a pure state evolution from a given initial state to a desired final state is formulated.We minimize the duration time for this transition by finding the optimal control for the Hamiltonian in an available set subject to a certain constraint dictated by physical conditions.Then, it will be extended to the unitary evolution which has greater relevance for quantum computation.This provides a systematic way to make an efficient unitary gate on a certain physical system.To demonstrate this framework, we choose the anisotropic Heisenberg model and find a general solution.Since it is not always possible to find a general solution for the fundamental equation for the time-optimal control, we introduce the simulated annealing method as a simple numerical method to show that our framework can be used for the system whose general solution cannot be found.The numerical analysis based on the Krotov iteration method is introduced and applied to the time-optimal quantum control problem to solve the problem efficiently.The optimal realization of the quantum Fourier transform for two or more qubit systems are derived.We consider two generalizations of the quantum brachistochrone for mixed state evolutions.One is the unitary evolution with ancilla system ended up with the final measurement on the ancilla.The other is the repetition of measurement or decoherence model which can be represented by the evolution with the master equation in the Lindblad form.Also, the relation between the fidelity to the target and the duration time is considerd.A.4 Quantum speed limit . . . . . . . . .
Minimum-time quantum control protocols can be obtained from the quantum brachistochrone formalism [Carlini, Hosoya, Koike, and Okudaira, Phys. Rev. Lett. 96, 06053, (2006)]. We point out that the original treatment implicitly applied the variational calculus with fixed boundary conditions. We argue that the genuine quantum brachistochrone problem involves a variational problem with a movable endpoint, contrary to the classical brachistochrone problem. This formulation not only simplifies the derivation of the quantum brachistochrone equation but introduces an additional constraint at the endpoint due to the boundary effect. We present the general solution to the full quantum brachistochrone equation and discuss its main features. Using it, we prove that the speed of evolution under constraints is reduced with respect to the unrestricted case. In addition, we find that solving the quantum brachistochrone equation is closely connected to solving the dynamics of the Lagrange multipliers, which is in general governed by nonlinear differential equations. Their numerical integration allows generating time-extremal trajectories. Furthermore, when the restricted operators form a closed subalgebra, the Lagrange multipliers become constant and the optimal Hamiltonian takes a concise form. The new class of analytically solvable models for the quantum brachistochrone problem opens up the possibility of applying it to many-body quantum systems, exploring notions related to geometry such as quantum speed limits, and advancing significantly the quantum state and gate preparation for quantum information processing.
Most methods of optimal control cannot obtain accurate time-optimal protocols. The quantum brachistochrone equation is an exception, and has the potential to provide accurate time-optimal protocols for a wide range of quantum control problems. So far, this potential has not been realized, however, due to the inadequacy of conventional numerical methods to solve it. Here we show that the quantum brachistochrone problem can be recast as that of finding geodesic paths in the space of unitary operators. We expect this brachistochrone-geodesic connection to have broad applications, as it opens up minimal-time control to the tools of geometry. As one such application, we use it to obtain a fast numerical method to solve the brachistochrone problem, and apply this method to two examples demonstrating its power.
We study the quantum brachistochrone problem for a spin-1 system in a magnetic field of constant absolute value. Such a system gives us the possibility to examine in detail the statement that the state vectors realizing evolution with the minimal time of passage evolve along the subspace spanned by the initial and final state vectors [Carlini et al., Phys. Rev. Lett. 96, 060503 (2006); Brody and Hook, J. Phys. A 39, L167 (2006)]. Considering an explicit example, we show the existence of a quantum brachistochrone with the minimal possible time; however, the state vector we study leaves the subspace spanned by the initial and final state vectors during evolution. This is the result of our choice of a more constrained Hamiltonian than the one assumed in the general quantum brachistochrone problem. It is worth noting that such an evolution, being more complicated, is time optimal but with larger time than in the general case. This might be important for experiments, where a general Hamiltonian with all the allowed parameters is difficult to implement, but a constrained one, depending on the magnetic field, can be realized. However, for the preconstrained Hamiltonian not all final states are accessible. The present result does not contradict the general statement of the quantum brachistochrone problem, but gives additional insight into possible realization of the time-optimal passage.
Compared with many other methods which only give time sub-optimal designs, the quantum brachistochrone equation has a great potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far it has been of limited use, however, due to the inadequacy of conventional numerical methods to solve it. Here, using differential geometry, we reformulate the quantum brachistochrone curves as geodesics on the unitary group. This identification allows us to design a numerical method that can efficiently solve the brachistochrone problem by first solving a family of geodesic equations.