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/0607151

The sum-over-histories formulation of quantum computing

Ben Rudiak-Gould

Published Jul 21, 2006• 9 citations
arXivHTMLPDF

Abstract

Since Deutsch (1985), quantum computers have been modeled exclusively in the language of state vectors and the Schroedinger equation. We present a complementary view of quantum circuits inspired by the path integral formalism of quantum mechanics, and examine its application to some simple textbook problems.
DOI
10.48550/arxiv.quant-ph/0607151

Related papers

A History of Feynman's Sum over Histories in Quantum Mechanics

Akira Inomata, Georg Junker

A history of Feynman's sum over histories is presented in brief. A focus is placed on the progress of path-integration techniques for exactly path-integrable problems in quantum mechanics.

arXiv:quant-ph/9811023•To be published in the proceedings of•Nov 10, 1998•0 citations

A Structural Theory of Quantum Computational Advantage from Admissible Histories

Bin Li

We propose a structural framework for interpreting quantum computational advantage in terms of admissible continuation of configurations. In this framework, a quantum computation is described not only as a sequence of gates acting on a state vector but also as the organization of admissible histories whose phase contributions combine coherently in a manner related to sum-over-histories and path-integral formulations of quantum mechanics. We identify three structural features that are relevant to quantum advantage: the multiplicity of admissible histories, the degree of phase coherence among them, and the non-factorizable structure of continuation constraints corresponding to entanglement-like global dependence. To make these features explicit, we introduce the notion of effective coherent multiplicity, which measures the coherently usable portion of an admissible-history space before probability normalization. We then formulate a structural speedup conjecture: substantial quantum advantage requires not merely a large number of possible histories but scalable coherent multiplicity supported by non-factorizable constraints whose instability remains bounded. We also introduce a coherent-fiber criterion, which identifies phase-alignable families of histories selected by compact computational relations as a structural source of coherent amplification. This formulation does not replace standard complexity-theoretic measures such as circuit size, query complexity, or BQP membership. Rather, it provides a complementary structural language for relating those measures to interference, entanglement, decoherence, and the organization of computational history space. The framework clarifies, at a structural level, why raw branching alone is insufficient for speedup, why unstructured search yields only a limited advantage, and why problems with compact global regularities, such as Simon’s problem and period finding, can support stronger coherent amplification. The paper also discusses how the proposed quantities relate to standard notions, including success amplitudes, entanglement measures, tensor-network simulability, and fault-tolerance constraints. In this way, admissible-history structure is presented as a diagnostic viewpoint for understanding both the power and limitations of quantum computation.

Quantum Reports•May 22, 2026•1 citation

Impossible Measurements on Quantum Fields

Rafael D. Sorkin

It is shown that the attempt to extend the notion of ideal measurement to quantum field theory leads to a conflict with locality, because (for most observables) the state vector reduction associated with an ideal measurement acts to transmit information faster than light. Two examples of such information-transfer are given, first in the quantum mechanics of a pair of coupled subsystems, and then for the free scalar field in flat spacetime. It is argued that this problem leaves the Hilbert space formulation of quantum field theory with no definite measurement theory, removing whatever advantages it may have seemed to possess vis a vis the sum-over-histories approach, and reinforcing the view that a sum-over-histories framework is the most promising one for quantum gravity. INTRODUCTION: IDEAL MEASUREMENTS AND QUANTUM FIELD THEORY Whatever may be its philosophical limitations, the textbook interpretation of nonrelativistic quantum mechanics is probably adequate to provide the quantum formalism with all the predictive power required for laboratory applications. It is also self-consistent in the sense that there exist idealized models of measurements which allow the system-observer boundary to be displaced arbitrarily far in the direction of the observer. And the associated “transformation theory” possesses a certain formal beauty, seemingly realizing the “complementarity principle” in terms of the unitary equivalence of all orthonormal bases.

arXiv:gr-qc/9302018•Cambridge University Press eBooks•Nov 16, 1956•136 citations

Quantum Gates and Circuits

Radhika Vathsan

We are now ready to see how computing with qubits can be done. In this book, we will mainly use the circuit model for computation which was first introduced by Deutsch [25]. We will represent by quantum “wires,” the qubits upon which manipulations. The length of the wire is to be interpreted as the time axis. Manipulations on qubits can be done using basic unitary operators that are the equivalents of logic “gates.” An algorithm, or a complete set of steps for achieving a processing task, is a combination of wires and gates representing a quantum circuit. This circuit must be thought of as a time sequence of events with every wire a way of representing qubit states, and with gates representing processing of those states.

CRC Press eBooks•Jul 21, 2015•3 citations

History operators in quantum mechanics

Leonardo Castellani

It is convenient to describe a quantum system at all times by means of a “history operator” [Formula: see text], encoding measurements and unitary time evolution between measurements. These operators naturally arise when computing the probability of measurement sequences, and generalize the “sum over position histories” of the Feynman path-integral. As we argue in this work, this description has some computational advantages over the usual state vector description, and may help to clarify some issues regarding nonlocality of quantum correlations and collapse. A measurement on a system described by [Formula: see text] modifies the history operator, [Formula: see text], where [Formula: see text] is the projector corresponding to the measurement. We refer to this modification as “history operator collapse”. Thus, [Formula: see text] keeps track of the succession of measurements on a system, and contains all histories compatible with the results of these measurements. The collapse modifies the history content of [Formula: see text], and therefore modifies also the past (relative to the measurement), but never in a way to violate causality. Probabilities of outcomes are obtained as [Formula: see text]. A similar formula yields probabilities for intermediate measurements, and reproduces the result of the two-vector formalism in the case of the given initial and final states. We apply the history operator formalism to a few examples: entangler circuit, Mach–Zehnder interferometer, teleportation circuit and three-box experiment. Not surprisingly, the propagation of coordinate eigenstates [Formula: see text] is described by a history operator [Formula: see text] containing the Feynman path-integral.

arXiv:1810.03624•International Journal of Quantum Information•Dec 1, 2019•9 citations

Quantum computing from a mathematical perspective: a description of the quantum circuit model

Joaquín Ossorio-Castillo, José M. Tornero

This paper is an essentially self-contained and rigorous description of the fundamental principles of quantum computing from a mathematical perspective. It is intended to help mathematicians who want to get a grasp of this quickly growing discipline and find themselves taken aback by the language gap between mathematics and the pioneering fields on the matter: computer science and quantum physics. A first version of this paper was originally published at arXiv in October 2018. Minor corrections added on Spring 2025.

arXiv:1810.08277•Oct 16, 2018•7 citations
We propose a structural framework for interpreting quantum computational advantage in terms of admissible continuation of configurations. In this framework, a quantum computation is described not only as a sequence of gates acting on a state vector but also as the organization of admissible histories whose phase contributions combine coherently in a manner related to sum-over-histories and path-integral formulations of quantum mechanics. We identify three structural features that are relevant to quantum advantage: the multiplicity of admissible histories, the degree of phase coherence among them, and the non-factorizable structure of continuation constraints corresponding to entanglement-like global dependence. To make these features explicit, we introduce the notion of effective coherent multiplicity, which measures the coherently usable portion of an admissible-history space before probability normalization. We then formulate a structural speedup conjecture: substantial quantum advantage requires not merely a large number of possible histories but scalable coherent multiplicity supported by non-factorizable constraints whose instability remains bounded. We also introduce a coherent-fiber criterion, which identifies phase-alignable families of histories selected by compact computational relations as a structural source of coherent amplification. This formulation does not replace standard complexity-theoretic measures such as circuit size, query complexity, or BQP membership. Rather, it provides a complementary structural language for relating those measures to interference, entanglement, decoherence, and the organization of computational history space. The framework clarifies, at a structural level, why raw branching alone is insufficient for speedup, why unstructured search yields only a limited advantage, and why problems with compact global regularities, such as Simon’s problem and period finding, can support stronger coherent amplification. The paper also discusses how the proposed quantities relate to standard notions, including success amplitudes, entanglement measures, tensor-network simulability, and fault-tolerance constraints. In this way, admissible-history structure is presented as a diagnostic viewpoint for understanding both the power and limitations of quantum computation.
It is shown that the attempt to extend the notion of ideal measurement to quantum field theory leads to a conflict with locality, because (for most observables) the state vector reduction associated with an ideal measurement acts to transmit information faster than light. Two examples of such information-transfer are given, first in the quantum mechanics of a pair of coupled subsystems, and then for the free scalar field in flat spacetime. It is argued that this problem leaves the Hilbert space formulation of quantum field theory with no definite measurement theory, removing whatever advantages it may have seemed to possess vis a vis the sum-over-histories approach, and reinforcing the view that a sum-over-histories framework is the most promising one for quantum gravity. INTRODUCTION: IDEAL MEASUREMENTS AND QUANTUM FIELD THEORY Whatever may be its philosophical limitations, the textbook interpretation of nonrelativistic quantum mechanics is probably adequate to provide the quantum formalism with all the predictive power required for laboratory applications. It is also self-consistent in the sense that there exist idealized models of measurements which allow the system-observer boundary to be displaced arbitrarily far in the direction of the observer. And the associated “transformation theory” possesses a certain formal beauty, seemingly realizing the “complementarity principle” in terms of the unitary equivalence of all orthonormal bases.
We are now ready to see how computing with qubits can be done. In this book, we will mainly use the circuit model for computation which was first introduced by Deutsch [25]. We will represent by quantum “wires,” the qubits upon which manipulations. The length of the wire is to be interpreted as the time axis. Manipulations on qubits can be done using basic unitary operators that are the equivalents of logic “gates.” An algorithm, or a complete set of steps for achieving a processing task, is a combination of wires and gates representing a quantum circuit. This circuit must be thought of as a time sequence of events with every wire a way of representing qubit states, and with gates representing processing of those states.
It is convenient to describe a quantum system at all times by means of a “history operator” [Formula: see text], encoding measurements and unitary time evolution between measurements. These operators naturally arise when computing the probability of measurement sequences, and generalize the “sum over position histories” of the Feynman path-integral. As we argue in this work, this description has some computational advantages over the usual state vector description, and may help to clarify some issues regarding nonlocality of quantum correlations and collapse. A measurement on a system described by [Formula: see text] modifies the history operator, [Formula: see text], where [Formula: see text] is the projector corresponding to the measurement. We refer to this modification as “history operator collapse”. Thus, [Formula: see text] keeps track of the succession of measurements on a system, and contains all histories compatible with the results of these measurements. The collapse modifies the history content of [Formula: see text], and therefore modifies also the past (relative to the measurement), but never in a way to violate causality. Probabilities of outcomes are obtained as [Formula: see text]. A similar formula yields probabilities for intermediate measurements, and reproduces the result of the two-vector formalism in the case of the given initial and final states. We apply the history operator formalism to a few examples: entangler circuit, Mach–Zehnder interferometer, teleportation circuit and three-box experiment. Not surprisingly, the propagation of coordinate eigenstates [Formula: see text] is described by a history operator [Formula: see text] containing the Feynman path-integral.
This paper is an essentially self-contained and rigorous description of the fundamental principles of quantum computing from a mathematical perspective. It is intended to help mathematicians who want to get a grasp of this quickly growing discipline and find themselves taken aback by the language gap between mathematics and the pioneering fields on the matter: computer science and quantum physics. A first version of this paper was originally published at arXiv in October 2018. Minor corrections added on Spring 2025.