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:1604.07452 · New Journal of Physics

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

Mark D Penney, Dax Enshan Koh, Robert W. Spekkens

Published Feb 21, 2017• 14 citations
arXivHTMLPDF

Abstract

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits.

DOI
10.1088/1367-2630/aa61ba

Related papers

Path integral formulation of finite-dimensional quantum mechanics in discrete phase space

Leonardo A. Pachon, Andres D. Gomez

We develop a path integral representation for the dynamics of quantum systems with a finite-dimensional Hilbert space, formulated entirely within a discrete phase space. Starting from the discrete Wigner function on ${\mathbb{Z}_d} \times {\mathbb{Z}_d}$ ($d$ an odd prime) and the associated Weyl transform built from generalized displacement operators, we derive an exact kernel that propagates the discrete Wigner function in time and, by iterating its composition law through a short-time approximation, obtain a sum-over-paths expression weighted by a discrete phase-space action -- the natural finite-dimensional counterpart of Marinov's functional. For Hamiltonians linear in the phase-space coordinates and at times strictly commensurate with the lattice, the fluctuation sum collapses to a deterministic shift, realizing the discrete analog of classical Hamiltonian flow. Applying the formalism to one and to two interacting qutrits ($d=3$), we show that the full entanglement dynamics -- captured by a closed-form linear entropy valid for all times -- requires the coherent contribution of all fluctuation sectors; the boundary-term (mean-field) sector alone fails to reproduce it. For a non-stabilizer Hamiltonian, where the short-time kernel is only approximate, the time-sliced path integral converges to the exact dynamics, including the dynamical generation of Wigner negativity. We discuss implications for the semiclassical simulation of many-body spin systems and for the characterization of non-classicality through Wigner negativity.

quant-pharXiv:2604.20776•Apr 23, 2026•1 citation

Analyzing Algebraic Quantum Circuits Using Exponential Sums

Dave BaconWim van Dam, Alexander C. Russell

We introduce and analyze circuits that are the quantum mechanical generalization of classical algebraic circuits. Using the algebraic operations of addition and multiplication, as well as the quantum Fourier transform, such circuits are well-defined for rings Z=mZ and finite fields Fq. The acceptance probabilities of such algebraic quantum circuits can be expressed as exponential sums Âx exp(2pi f(x)=m) where the multivariate polynomial f is determined by the circuit, while it is independent of the ring or field over which we interpret the circuit. Dawson et al. [Quantum Information & Computation, 5(2), pp. 102‐112 (2004)] introduced this “sum over paths” description as a discrete version of the path integral approach of standard quantum mechanics. From this perspective, the polynomial f should be interpreted as the “action” of a specific (classical) computational path between the input and output of the circuit. In this article we prove several properties of algebraic quantum circuits. Using the theory of exponential sums, we show that in the limit of large m or q, the acceptance probabilities of a circuit converge to zero or to one. Circuits that do not involve the multiplication operation are the algebraic generalization of Clifford circuits and we show how their acceptance probabilities can be calculated exactly in a classical efficient manner. For algebraic circuits that are defined over rings Z=p r Z we derive a “least action principle” that shows how the behaviour of such circuits is determined by those computational paths whose action polynomials are extremal.

•Jan 1, 2008•10 citations

The Weyl correspondence and path integrals

Maurice M. Mizrahi

The method of Weyl transforms is used to rigorously derive path integral forms for position and momentum transition amplitudes from the time-dependent Schrödinger equation for arbitrary Hermitian Hamiltonians. It is found that all paths in phase space contribute equally in magnitude, but that each path has a different phase, equal to 1/h/ times an ’’effective action’’ taken along it. The latter is the time integral of p⋅q̇−h (p,q), h (p,q) being the Weyl transform of the Hamiltonian operator H, which differs from the classical Hamiltonian function by terms of order h/2, vanishing in the classical limit. These terms, which can be explicitly computed, are zero for relatively simple Hamiltonians, such as (1/2M)[P−eA (Q)]2+V (Q), but appear when the coupling of the position and momentum operators is stronger, such as for a relativistic spinless particle in an electromagnetic field, or when configuration space is curved. They are always zero if one opts for Weyl’s rule for forming the quantum operator corresponding to a given classical Hamiltonian. The transition amplitude between two position states is found to be expressible as a path integral in configuration space alone only in very special cases, such as when the Hamiltonian is quadratic in the momenta.

Journal of Mathematical Physics•Nov 1, 1975•131 citations

Stationary Phase Method in Discrete Wigner Functions and Classical Simulation of Quantum Circuits

Lucas Kocia, Peter J. Love

One of the lowest-order corrections to Gaussian quantum mechanics in infinite-dimensional Hilbert spaces are Airy functions: a uniformization of the stationary phase method applied in the path integral perspective. We introduce a "periodized stationary phase method" to discrete Wigner functions of systems with odd prime dimension and show that the π8 gate is the discrete analog of the Airy function. We then establish a relationship between the stabilizer rank of states and the number of quadratic Gauss sums necessary in the periodized stationary phase method. This allows us to develop a classical strong simulation of a single qutrit marginal on t qutrit π8 gates that are followed by Clifford evolution, and show that this only requires 3t2+1 quadratic Gauss sums. This outperforms the best alternative qutrit algorithm (based on Wigner negativity and scaling as ∼30.8t for 10−2 precision) for any number of π8 gates to full precision.

arXiv:1810.03622•Quantum•Jul 5, 2021•8 citations

Semiclassical formulation of the Gottesman-Knill theorem and universal quantum computation

Lucas Kocia, Yifei Huang, Peter J. Love

We give a path-integral formulation of the time evolution of qudits of odd dimension. This allows us to consider semiclassical evolution of discrete systems in terms of an expansion of the propagator in powers of $\ensuremath{\hbar}$. The largest power of $\ensuremath{\hbar}$ required to describe the evolution is a traditional measure of classicality. We show that the action of the Clifford operators on stabilizer states can be fully described by a single contribution of a path integral truncated at order ${\ensuremath{\hbar}}^{0}$ and so are ``classical,'' just like propagation of Gaussians under harmonic Hamiltonians in the continuous case. Such operations have no dependence on phase or quantum interference. Conversely, we show that supplementing the Clifford group with gates necessary for universal quantum computation results in a propagator consisting of a finite number of semiclassical path-integral contributions truncated at order ${\ensuremath{\hbar}}^{1}$, a number that nevertheless scales exponentially with the number of qudits. The same sum in continuous systems has an infinite number of terms at order ${\ensuremath{\hbar}}^{1}$.

arXiv:1612.05649•Physical Review A•Sep 20, 2017•9 citations

Computing quopit Clifford circuit amplitudes by the sum-over-paths technique

Dax Enshan Koh, Mark D Penney, Robert W. Spekkens

By the Gottesman-Knill Theorem, the outcome probabilities of Clifford circuits can be computed efficiently. We present an alternative proof of this result for quopit Clifford circuits (i.e., Clifford circuits on collections of p-level systems, where p is an odd prime) using Feynman’s sum-over-paths technique, which allows the amplitudes of arbitrary quantum circuits to be expressed in terms of a weighted sum over computational paths. For a general quantum circuit, the sum over paths contains an exponential number of terms, and no efficient classical algorithm is known that can compute the sum. For quopit Clifford circuits, however, we show that the sum over paths takes a special form: it can be expressed as a product of Weil sums with quadratic polynomials, which can be computed efficiently. This provides a method for computing the outcome probabilities and amplitudes of such circuits efficiently, and is an application of the circuit-polynomial correspondence which relates quantum circuits to low-degree polynomials.

arXiv:1702.03316•Quantum Information and Computation•Nov 1, 2017•20 citations
It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits.
We develop a path integral representation for the dynamics of quantum systems with a finite-dimensional Hilbert space, formulated entirely within a discrete phase space. Starting from the discrete Wigner function on Zd×Zd{\mathbb{Z}_d} \times {\mathbb{Z}_d}Zd​×Zd​ (ddd an odd prime) and the associated Weyl transform built from generalized displacement operators, we derive an exact kernel that propagates the discrete Wigner function in time and, by iterating its composition law through a short-time approximation, obtain a sum-over-paths expression weighted by a discrete phase-space action -- the natural finite-dimensional counterpart of Marinov's functional. For Hamiltonians linear in the phase-space coordinates and at times strictly commensurate with the lattice, the fluctuation sum collapses to a deterministic shift, realizing the discrete analog of classical Hamiltonian flow. Applying the formalism to one and to two interacting qutrits (d=3d=3d=3), we show that the full entanglement dynamics -- captured by a closed-form linear entropy valid for all times -- requires the coherent contribution of all fluctuation sectors; the boundary-term (mean-field) sector alone fails to reproduce it. For a non-stabilizer Hamiltonian, where the short-time kernel is only approximate, the time-sliced path integral converges to the exact dynamics, including the dynamical generation of Wigner negativity. We discuss implications for the semiclassical simulation of many-body spin systems and for the characterization of non-classicality through Wigner negativity.
We introduce and analyze circuits that are the quantum mechanical generalization of classical algebraic circuits. Using the algebraic operations of addition and multiplication, as well as the quantum Fourier transform, such circuits are well-defined for rings Z=mZ and finite fields Fq. The acceptance probabilities of such algebraic quantum circuits can be expressed as exponential sums Âx exp(2pi f(x)=m) where the multivariate polynomial f is determined by the circuit, while it is independent of the ring or field over which we interpret the circuit. Dawson et al. [Quantum Information & Computation, 5(2), pp. 102‐112 (2004)] introduced this “sum over paths” description as a discrete version of the path integral approach of standard quantum mechanics. From this perspective, the polynomial f should be interpreted as the “action” of a specific (classical) computational path between the input and output of the circuit. In this article we prove several properties of algebraic quantum circuits. Using the theory of exponential sums, we show that in the limit of large m or q, the acceptance probabilities of a circuit converge to zero or to one. Circuits that do not involve the multiplication operation are the algebraic generalization of Clifford circuits and we show how their acceptance probabilities can be calculated exactly in a classical efficient manner. For algebraic circuits that are defined over rings Z=p r Z we derive a “least action principle” that shows how the behaviour of such circuits is determined by those computational paths whose action polynomials are extremal.
The method of Weyl transforms is used to rigorously derive path integral forms for position and momentum transition amplitudes from the time-dependent Schrödinger equation for arbitrary Hermitian Hamiltonians. It is found that all paths in phase space contribute equally in magnitude, but that each path has a different phase, equal to 1/h/ times an ’’effective action’’ taken along it. The latter is the time integral of p⋅q̇−h (p,q), h (p,q) being the Weyl transform of the Hamiltonian operator H, which differs from the classical Hamiltonian function by terms of order h/2, vanishing in the classical limit. These terms, which can be explicitly computed, are zero for relatively simple Hamiltonians, such as (1/2M)[P−eA (Q)]2+V (Q), but appear when the coupling of the position and momentum operators is stronger, such as for a relativistic spinless particle in an electromagnetic field, or when configuration space is curved. They are always zero if one opts for Weyl’s rule for forming the quantum operator corresponding to a given classical Hamiltonian. The transition amplitude between two position states is found to be expressible as a path integral in configuration space alone only in very special cases, such as when the Hamiltonian is quadratic in the momenta.
One of the lowest-order corrections to Gaussian quantum mechanics in infinite-dimensional Hilbert spaces are Airy functions: a uniformization of the stationary phase method applied in the path integral perspective. We introduce a "periodized stationary phase method" to discrete Wigner functions of systems with odd prime dimension and show that the π8 gate is the discrete analog of the Airy function. We then establish a relationship between the stabilizer rank of states and the number of quadratic Gauss sums necessary in the periodized stationary phase method. This allows us to develop a classical strong simulation of a single qutrit marginal on t qutrit π8 gates that are followed by Clifford evolution, and show that this only requires 3t2+1 quadratic Gauss sums. This outperforms the best alternative qutrit algorithm (based on Wigner negativity and scaling as ∼30.8t for 10−2 precision) for any number of π8 gates to full precision.
We give a path-integral formulation of the time evolution of qudits of odd dimension. This allows us to consider semiclassical evolution of discrete systems in terms of an expansion of the propagator in powers of $\ensuremath{\hbar}$. The largest power of $\ensuremath{\hbar}$ required to describe the evolution is a traditional measure of classicality. We show that the action of the Clifford operators on stabilizer states can be fully described by a single contribution of a path integral truncated at order ${\ensuremath{\hbar}}^{0}$ and so are ``classical,'' just like propagation of Gaussians under harmonic Hamiltonians in the continuous case. Such operations have no dependence on phase or quantum interference. Conversely, we show that supplementing the Clifford group with gates necessary for universal quantum computation results in a propagator consisting of a finite number of semiclassical path-integral contributions truncated at order ${\ensuremath{\hbar}}^{1}$, a number that nevertheless scales exponentially with the number of qudits. The same sum in continuous systems has an infinite number of terms at order ${\ensuremath{\hbar}}^{1}$.
By the Gottesman-Knill Theorem, the outcome probabilities of Clifford circuits can be computed efficiently. We present an alternative proof of this result for quopit Clifford circuits (i.e., Clifford circuits on collections of p-level systems, where p is an odd prime) using Feynman’s sum-over-paths technique, which allows the amplitudes of arbitrary quantum circuits to be expressed in terms of a weighted sum over computational paths. For a general quantum circuit, the sum over paths contains an exponential number of terms, and no efficient classical algorithm is known that can compute the sum. For quopit Clifford circuits, however, we show that the sum over paths takes a special form: it can be expressed as a product of Weil sums with quadratic polynomials, which can be computed efficiently. This provides a method for computing the outcome probabilities and amplitudes of such circuits efficiently, and is an application of the circuit-polynomial correspondence which relates quantum circuits to low-degree polynomials.