Quantum brachistochrone
Abstract
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'.
Read the paper
Related studies
- In silico toxicology protocols
- QM7-X, a comprehensive dataset of quantum-mechanical properties spanning the chemical space of small organic molecules
- Quantum Informed Machine-Learning Potentials for Molecular Dynamics Simulations of CO2's Chemisorption and Diffusion in Mg-MOF-74
- In-silico strategies in nano-drug design: Bridging nanomaterials and pharmacological applications
- mRNA codon optimization with quantum computers
- The computational power of the human brain
Go deeper in Evidence Hub
Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.