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

Nature

Quantum computing takes flight

William D. Oliver

Published Oct 23, 2019• 16 citations
Publisher
DOI
10.1038/d41586-019-03173-4

Related papers

Light Takes a Flight Back

Anonymous

Physics•Mar 15, 2012•0 citations

The Promise of Quantum Computing

Jeff Kabachinski

Biomedical Instrumentation & Technology•Dec 1, 2013•0 citations

Chapter 12. The Tunnelling Flight Time

Eli Pollak

How much time does it take for a particle to tunnel through a barrier? This question continues to baffle up to this very day, one of the reasons being the non-existence of an energy–time commutator analogous to the position–momentum commutation relation. Instead of worrying about the definition of an operator one may consider time as a parameter in the time-dependent Schrödinger equation and study the time evolution of a wavepacket appropriately scattered on a potential barrier. Using this approach, one may formally define a tunnelling flight time that may be measured in a time-of-flight experiment. The resulting tunnelling flight time either vanishes or is very small. The implications of this observation with respect to recent hydrogen and helium atom attosecond photoionization experiments are discussed. The vanishing or small flight time does not contradict the finite time measured in Larmor clock experiments, where the tunnelling particle affects an external degree of freedom whose dynamics induced by the tunnelling may be interpreted in terms of a time scale. Flight times are also relevant to quantum reflection where coherences due to resonance scattering are not well accounted for by Wigner's phase time delay.

RSC theoretical and computational chemistry series•Jan 1, 2020•2 citations

Quantum Computing: Stepping Closer to Reality

Nancy Forbes, Seth Lloyd

Computers in Physics•Jan 1, 1998•0 citations

The future of quantum computing

Jeremy J. Ramsden

Nanotechnology Perceptions•Mar 18, 2021•0 citations

Quantum Computing Applications for Flight Trajectory Optimization

Henry Makhanov, Kanav Setia, Junyu Liu +2 more

Major players in the global aerospace industry are shifting their focus toward achieving net carbon-neutral operations by 2050. A considerable portion of the overall carbon emission reduction is expected to come from new aircraft technologies, such as flight path optimization. In pursuing these sustainability objectives, we delve into the capacity of quantum computing to tackle computational challenges associated with flight path optimization, an essential operation within the aerospace engineering domain with important ecological and economic considerations. In recent years, the quantum computing field has made significant strides, paving the way for improved performance over classical algorithms. In order to effectively apply quantum algorithms in real-world scenarios, it is crucial to thoroughly examine and tackle the intrinsic overheads and constraints that exist in the present implementations of these algorithms. Our study delves into the application of quantum computers in flight path optimization problems and introduces a customizable modular framework designed to accommodate specific simulation requirements. We examine the running time of a hybrid quantum-classical algorithm across various quantum architectures and their simulations on CPUs and GPUs. A temporal comparison between the conventional classical algorithm and its quantum-improved counterpart indicates that achieving the theoretical speedup in practice may necessitate further innovation. We present our results from running the quantum algorithms on IBM hardware and discuss potential approaches to accelerate the incorporation of quantum algorithms within the problem domain.

arXiv:2304.14445•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Jul 1, 2024•16 citations
How much time does it take for a particle to tunnel through a barrier? This question continues to baffle up to this very day, one of the reasons being the non-existence of an energy–time commutator analogous to the position–momentum commutation relation. Instead of worrying about the definition of an operator one may consider time as a parameter in the time-dependent Schrödinger equation and study the time evolution of a wavepacket appropriately scattered on a potential barrier. Using this approach, one may formally define a tunnelling flight time that may be measured in a time-of-flight experiment. The resulting tunnelling flight time either vanishes or is very small. The implications of this observation with respect to recent hydrogen and helium atom attosecond photoionization experiments are discussed. The vanishing or small flight time does not contradict the finite time measured in Larmor clock experiments, where the tunnelling particle affects an external degree of freedom whose dynamics induced by the tunnelling may be interpreted in terms of a time scale. Flight times are also relevant to quantum reflection where coherences due to resonance scattering are not well accounted for by Wigner's phase time delay.
Major players in the global aerospace industry are shifting their focus toward achieving net carbon-neutral operations by 2050. A considerable portion of the overall carbon emission reduction is expected to come from new aircraft technologies, such as flight path optimization. In pursuing these sustainability objectives, we delve into the capacity of quantum computing to tackle computational challenges associated with flight path optimization, an essential operation within the aerospace engineering domain with important ecological and economic considerations. In recent years, the quantum computing field has made significant strides, paving the way for improved performance over classical algorithms. In order to effectively apply quantum algorithms in real-world scenarios, it is crucial to thoroughly examine and tackle the intrinsic overheads and constraints that exist in the present implementations of these algorithms. Our study delves into the application of quantum computers in flight path optimization problems and introduces a customizable modular framework designed to accommodate specific simulation requirements. We examine the running time of a hybrid quantum-classical algorithm across various quantum architectures and their simulations on CPUs and GPUs. A temporal comparison between the conventional classical algorithm and its quantum-improved counterpart indicates that achieving the theoretical speedup in practice may necessitate further innovation. We present our results from running the quantum algorithms on IBM hardware and discuss potential approaches to accelerate the incorporation of quantum algorithms within the problem domain.