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

A new path towards quantum computers

Anders Søndberg Sørensen

Published Nov 30, 2013• 0 citations
OpenAlex

Related papers

Feynman Machine: A Geometric Computational Machinery Based on the Path Integration

Yoshiteru Ishida

This paper proposes a framework for a new quantum computation based on the Feynman's path integral. The Feynman's path integral has been studied in quantum physics, however, the computational machinery may be used in universal computations. The light path design will be done in a light geometric automaton. As examples, we will present the primality test of an integer (for the deterministic case of light particle) and the stable marriage problem (for the probabilistic case of light wave).

Procedia Computer Science•Jan 1, 2016•0 citations

Road to new quantum computers

Nature India•May 30, 2009•0 citations

Role of Coherence for Quantum Computational Advantage

Hugo Thomas, Pierre-Emmanuel Emeriau, Rawad Mezher +3 more

Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness, and coherence are arguably of great significance. We introduce "path coherence" as a measure of the coherent path interferences arising in a quantum computation. Leveraging the sum-over-paths formalism, we obtain a classical algorithm for estimating quantum transition amplitudes, the complexity of which scales with path coherence. As path coherence relates to the hardness of classical estimation of quantum transition amplitudes, it provides a new perspective on the role of coherence in quantum computational advantage. Beyond their fundamental significance, our results have practical applications for simulating large classes of quantum computations with classical computers.

arXiv:2410.07024•Physical Review Letters•Aug 15, 2025•5 citations

The Path to Powerful Quantum Computers

Samuel Jaques

IEEE Security & Privacy•Mar 1, 2026•1 citation

Another step toward quantum computers

Physics Today•Nov 21, 2006•0 citations

Particle Propagator in Elementary Quantum Mechanics: a New Path Integral Derivation

Stefano Ansoldi, Aurilia, A, Spallucci, E

This paper suggests a new way to compute the path integral for simple quantum mechanical systems. The new algorithm originated from previous research in string theory. However, its essential simplicity is best illustrated in the case of a free non relativistic particle, discussed here, and can be appreciated by most students taking an introductory course in Quantum Mechanics. Indeed, the emphasis is on the role played by the {\\it entire family of classical trajectories} in terms of which the path integral is computed exactly using a functional representation of the Dirac delta-distribution. We argue that the new algorithm leads to a deeper insight into the connection between classical and quantum systems, especially those encountered in high energy physics.

•Jan 1, 2000•10 citations
This paper proposes a framework for a new quantum computation based on the Feynman's path integral. The Feynman's path integral has been studied in quantum physics, however, the computational machinery may be used in universal computations. The light path design will be done in a light geometric automaton. As examples, we will present the primality test of an integer (for the deterministic case of light particle) and the stable marriage problem (for the probabilistic case of light wave).
Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness, and coherence are arguably of great significance. We introduce "path coherence" as a measure of the coherent path interferences arising in a quantum computation. Leveraging the sum-over-paths formalism, we obtain a classical algorithm for estimating quantum transition amplitudes, the complexity of which scales with path coherence. As path coherence relates to the hardness of classical estimation of quantum transition amplitudes, it provides a new perspective on the role of coherence in quantum computational advantage. Beyond their fundamental significance, our results have practical applications for simulating large classes of quantum computations with classical computers.
This paper suggests a new way to compute the path integral for simple quantum mechanical systems. The new algorithm originated from previous research in string theory. However, its essential simplicity is best illustrated in the case of a free non relativistic particle, discussed here, and can be appreciated by most students taking an introductory course in Quantum Mechanics. Indeed, the emphasis is on the role played by the {\\it entire family of classical trajectories} in terms of which the path integral is computed exactly using a functional representation of the Dirac delta-distribution. We argue that the new algorithm leads to a deeper insight into the connection between classical and quantum systems, especially those encountered in high energy physics.