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

Quantum Brachistochrone

陽介 奥平, Yosuke Okudaira

Published Sep 1, 2006• 0 citations
OpenAlex

Related papers

Quantum Dynamics of Brachistochrone Problem

Melike Behiye Yücel, Nuri Ünal

Springer eBooks•Jan 1, 2004•0 citations

Quantization for brachistochrone problem

Melike Behiye Yücel, Nuri Ünal

The European Physical Journal D•Aug 1, 2003•1 citation

Solving the quantum brachistochrone equation through differential geometry

Chenglong You, Jonathan P. Dowling, Xiaoting Wang

Bulletin of the American Physical Society•Mar 14, 2017•0 citations

Quantum brachistochrone

Tatsuhiko Koike

Quantum brachistochrone (QB) is a quantum analogue of classical brachistochrone (shortest path). It is a solution to the following problem: How can we perform a desired quantum operation (or obtain a desired final quantum state) most quickly, by a time-dependent Hamiltonian subject to given constraints? Finding QB is a fundamental problem in quantum mechanics in its own right. Moreover, it will be useful in the study of quantum information and quantum engineering, such as quantum speed limits and implementations of quantum computers. A general framework for finding QBs, called QB formalism, has been developed. It is based on Pontryagin's maximum principle. We review the basics of the QB formalism, give simple examples, and briefly discuss some related studies. This article is part of the theme issue 'Shortcuts to adiabaticity: theoretical, experimental and interdisciplinary perspectives'.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Nov 6, 2022•15 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•7 citations

Quantum Alternation

Abuzer Yakaryılmaz

Lecture notes in computer science•Jan 1, 2013•6 citations
Quantum brachistochrone (QB) is a quantum analogue of classical brachistochrone (shortest path). It is a solution to the following problem: How can we perform a desired quantum operation (or obtain a desired final quantum state) most quickly, by a time-dependent Hamiltonian subject to given constraints? Finding QB is a fundamental problem in quantum mechanics in its own right. Moreover, it will be useful in the study of quantum information and quantum engineering, such as quantum speed limits and implementations of quantum computers. A general framework for finding QBs, called QB formalism, has been developed. It is based on Pontryagin's maximum principle. We review the basics of the QB formalism, give simple examples, and briefly discuss some related studies. This article is part of the theme issue 'Shortcuts to adiabaticity: theoretical, experimental and interdisciplinary perspectives'.
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.