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

It is straightforward to give a sum-over-paths expression for the transition amplitudes of a quantum circuit as long as the gates in the circuit are balanced, where to be balanced is to have all nonzero transition amplitudes 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.

[1]  Carlo Rovelli,et al.  Discreteness of area and volume in quantum gravity [Nucl. Phys. B 442 (1995) 593] , 1994, gr-qc/9411005.

[2]  Robert W. Spekkens,et al.  Computing quopit Clifford circuit amplitudes by the sum-over-paths technique , 2017, Quantum Inf. Comput..

[3]  Michael A. Nielsen,et al.  Quantum computing and polynomial equations over the finite field Z2 , 2005, Quantum Inf. Comput..

[4]  Alexander Russell,et al.  Analyzing Algebraic Quantum Circuits Using Exponential Sums , 2008 .

[5]  Tommaso Toffoli,et al.  Cellular Automata Machines , 1987, Complex Syst..

[6]  Stefano Pironio,et al.  Random numbers certified by Bell’s theorem , 2009, Nature.

[7]  A. Kent Path Integrals and Reality , 2013, 1305.6565.

[8]  Michael A. Nielsen,et al.  Quantum computing and polynomial equations over the finite field Z 2 , 2004 .

[9]  D. Gottesman The Heisenberg Representation of Quantum Computers , 1998, quant-ph/9807006.

[10]  R. Balian,et al.  Solution of the Schrodinger Equation in Terms of Classical Paths , 1974 .

[11]  John Watrous,et al.  On one-dimensional quantum cellular automata , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[12]  Maarten Van Den Nes Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond , 2010 .

[13]  Kae Nemoto,et al.  Efficient classical simulation of continuous variable quantum information processes. , 2002, Physical review letters.

[14]  F. Pirani MATHEMATICAL METHODS OF CLASSICAL MECHANICS (Graduate Texts in Mathematics, 60) , 1982 .

[15]  R. Werner,et al.  Reversible quantum cellular automata , 2004, quant-ph/0405174.

[16]  William K. Wootters,et al.  Discrete phase space based on finite fields (23 pages) , 2004 .

[17]  Robert W. Spekkens,et al.  Reconstruction of Gaussian quantum mechanics from Liouville mechanics with an epistemic restriction , 2011, 1111.5057.

[18]  Sean Clark Valence bond solid formalism for d-level one-way quantum computation , 2005, quant-ph/0512155.

[19]  Discrete phase space based on finite fields , 2004, quant-ph/0401155.

[20]  Daniel A. Lidar,et al.  Reexamining classical and quantum models for the D-Wave One processor , 2014, 1409.3827.

[21]  Petros Wallden,et al.  Causal sets: Quantum gravity from a fundamentally discrete spacetime , 2010 .

[22]  Pawel Blasiak Quantum cube: A toy model of a qubit , 2012 .

[23]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[24]  H. Briegel,et al.  Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.

[25]  Christopher Ferrie,et al.  Frame representations of quantum mechanics and the necessity of negativity in quasi-probability representations , 2007, 0711.2658.

[26]  Y. Ng,et al.  Limitation to Quantum Measurements of Space‐Time Distances a , 1994, hep-th/9406110.

[27]  Niklas Johansson,et al.  Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms , 2015, Quantum Information Processing.

[28]  Richard L. Barnes Stabilizer Codes for Continuous-variable Quantum Error Correction , 2004, quant-ph/0405064.

[29]  Stephen D. Bartlett,et al.  Non-negative subtheories and quasiprobability representations of qubits , 2012, 1203.2652.

[30]  J. Bell On the Problem of Hidden Variables in Quantum Mechanics , 1966 .

[31]  R. Spekkens Contextuality for preparations, transformations, and unsharp measurements , 2004, quant-ph/0406166.

[32]  D. Browne,et al.  Computational power of correlations. , 2008, Physical review letters.

[33]  Dax Enshan Koh,et al.  Further extensions of Clifford circuits and their classical simulation complexities , 2015, Quantum Inf. Comput..

[34]  Maarten Van den Nest,et al.  Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond , 2008, Quantum Inf. Comput..

[35]  E. Fredkin Digital mechanics: an informational process based on reversible universal cellular automata , 1990 .

[36]  L. Hörmander The analysis of linear partial differential operators , 1990 .

[37]  J. S. BELLt Einstein-Podolsky-Rosen Paradox , 2018 .

[38]  R. Jozsa,et al.  Matchgates and classical simulation of quantum circuits , 2008, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[39]  Paolo Perinotti,et al.  Quantum cellular automata and free quantum field theory , 2016 .

[40]  D. Gross Hudson's theorem for finite-dimensional quantum systems , 2006, quant-ph/0602001.

[41]  G. Dunne,et al.  Complexified Path Integrals, Exact Saddles, and Supersymmetry. , 2015, Physical review letters.

[42]  Adrian Kent,et al.  No signaling and quantum key distribution. , 2004, Physical review letters.

[43]  Gottesman Class of quantum error-correcting codes saturating the quantum Hamming bound. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[44]  John C. Baez,et al.  An algebraic approach to discrete mechanics , 1994 .

[45]  Daniel Gottesman Fault-Tolerant Quantum Computation with Higher-Dimensional Systems , 1998, QCQC.

[46]  R. Feynman,et al.  Quantum Mechanics and Path Integrals , 1965 .

[47]  Daniel J. Brod,et al.  Efficient classical simulation of matchgate circuits with generalized inputs and measurements , 2016, 1602.03539.

[48]  L. Hörmander,et al.  The Analysis of Linear Partial Differential Operators I: Distribution Theory and Fourier Analysis , 1983 .

[49]  P. Dirac,et al.  THE LAGRANGIAN IN QUANTUM MECHANICS. , 2022 .

[50]  B. Moor,et al.  Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic , 2004, quant-ph/0408190.

[51]  Robert W Spekkens,et al.  Negativity and contextuality are equivalent notions of nonclassicality. , 2006, Physical review letters.

[52]  Victor Veitch,et al.  Contextuality supplies the ‘magic’ for quantum computation , 2014, Nature.

[53]  Leslie G. Valiant,et al.  Quantum Circuits That Can Be Simulated Classically in Polynomial Time , 2002, SIAM J. Comput..

[54]  Huangjun Zhu Permutation Symmetry Determines the Discrete Wigner Function. , 2015, Physical review letters.