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

arXiv:quant-ph/0109113 · Quantum Information Processing

Path Integration on a Quantum Computer

Joseph F. Traub, H. Woźniakowski

Published Oct 1, 2002• 49 citations
arXivHTMLPDF
DOI
10.1023/a:1023417813916

Related papers

Path integrals and quantum computing

David B. Mumford

American Mathematical Society eBooks•Sep 27, 2023•0 citations

Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation

E. V. Krishnamurthy

This paper studies the computational power of quantum computers to explore as to whether they can recognize properties which are in nondeterministic polynomial-time class (NP) and beyond. To study the computational power, we use the Feynman's path integral (FPI) formulation of quantum mechanics. From a computational point of view the Feynman's path integral computes a quantum dynamical analogue of the k-ary relation computed by an Alternating Turing machine (ATM) using AND-OR Parallelism. Hence, if we can find a suitable mapping function between an instance of a mathematical problem and the corresponding interference problem, using suitable potential functions for which FPI can be integrated exactly, the computational power of a quantum computer can be bounded to that of an alternating Turing machine that can solve problems in NP (e.g, factorization problem) and in polynomial space. Unfortunately, FPI is exactly integrable only for a few problems (e.g., the harmonic oscillator) involving quadratic potentials; otherwise, they may be only approximately computable or noncomputable. This means we cannot in general solve all quantum dynamical problems exactly except for those special cases of quadratic potentials, e.g., harmonic oscillator. Since there is a one to one correspondence between the quantum mechanical problems that can be analytically solved and the path integrals that can be exactly evaluated, we can say that the noncomputability of FPI implies quantum unsolvability. This is the analogue of classical unsolvability. The Feynman's path graph can be considered as a semantic parse graph for the quantum mechanical sentence. It provides a semantic valuation function of the terminal sentence based on probability amplitudes to disambiguate a given quantum description and obtain an interpretation in a linear time. In Feynman's path integral, the kernels are partially ordered over time (different alternate paths acting concurrently at the same time) and multiplied. The semantic valuation is computable only if the FPI is computable. Thus both the expressive power and complexity aspects quantum computing are mirrored by the exact and efficient integrability of FPI.

International Journal of Modern Physics C•Mar 1, 1998•7 citations

Quantum Mechanical Path Integrals

Mark S. Swanson

Elsevier eBooks•Jan 1, 1992•2 citations

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

Worldline Path Integrals for Gauge Fields and Quantum Computing

Feng, Yuan, Michael McGuigan

We study different aspects the worldline path integrals with gauge fields using quantum computing. We use the Variational Quantum Eigensolver (VQE) and Evolution of Hamiltonian (EOH) quantum algorithms and IBM QISKit to perform our computations. We apply these methods to the path integral of a particle moving in a Abelian and non-Abelian background gauge field associated with a constant magnetic field and the field of a chromo-magnetic field. In all cases we found excellent agreement with the classical computation. We also discuss the insertion of vertex operators into the worldline path integrals to study scattering and show how to represent them using unitary operators and quantum gates on near term quantum computers.

arXiv:2106.01398•Jun 2, 2021•0 citations

The quantum mechanical path integral

Mark S. Swanson

Institute of Physics eBooks•Aug 1, 2020•0 citations
This paper studies the computational power of quantum computers to explore as to whether they can recognize properties which are in nondeterministic polynomial-time class (NP) and beyond. To study the computational power, we use the Feynman's path integral (FPI) formulation of quantum mechanics. From a computational point of view the Feynman's path integral computes a quantum dynamical analogue of the k-ary relation computed by an Alternating Turing machine (ATM) using AND-OR Parallelism. Hence, if we can find a suitable mapping function between an instance of a mathematical problem and the corresponding interference problem, using suitable potential functions for which FPI can be integrated exactly, the computational power of a quantum computer can be bounded to that of an alternating Turing machine that can solve problems in NP (e.g, factorization problem) and in polynomial space. Unfortunately, FPI is exactly integrable only for a few problems (e.g., the harmonic oscillator) involving quadratic potentials; otherwise, they may be only approximately computable or noncomputable. This means we cannot in general solve all quantum dynamical problems exactly except for those special cases of quadratic potentials, e.g., harmonic oscillator. Since there is a one to one correspondence between the quantum mechanical problems that can be analytically solved and the path integrals that can be exactly evaluated, we can say that the noncomputability of FPI implies quantum unsolvability. This is the analogue of classical unsolvability. The Feynman's path graph can be considered as a semantic parse graph for the quantum mechanical sentence. It provides a semantic valuation function of the terminal sentence based on probability amplitudes to disambiguate a given quantum description and obtain an interpretation in a linear time. In Feynman's path integral, the kernels are partially ordered over time (different alternate paths acting concurrently at the same time) and multiplied. The semantic valuation is computable only if the FPI is computable. Thus both the expressive power and complexity aspects quantum computing are mirrored by the exact and efficient integrability of FPI.
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).
We study different aspects the worldline path integrals with gauge fields using quantum computing. We use the Variational Quantum Eigensolver (VQE) and Evolution of Hamiltonian (EOH) quantum algorithms and IBM QISKit to perform our computations. We apply these methods to the path integral of a particle moving in a Abelian and non-Abelian background gauge field associated with a constant magnetic field and the field of a chromo-magnetic field. In all cases we found excellent agreement with the classical computation. We also discuss the insertion of vertex operators into the worldline path integrals to study scattering and show how to represent them using unitary operators and quantum gates on near term quantum computers.