Feynman-path type simulation using stabilizer projector decomposition of unitaries
arXiv:2009.05110 · doi:10.1103/PhysRevA.103.022428
Abstract
We propose a classical simulation method for quantum circuits based on decomposing unitary gates into a sum of stabilizer projectors. By only decomposing the non-Clifford gates, we take advantage of the Gottesman-Knill theorem and build a bridge between stabilizer-based simulation and Feynman-path-type simulation. We give two variants of this method: stabilizer-based path-integral recursion (SPIR) and stabilizer projector contraction (SPC). We also analyze further advantages and disadvantages of our method compared to the Bravyi-Gosset algorithm and recursive Feynman path-integral algorithms. We construct a parametrized circuit ensemble and identify the parameter regime in this ensemble where our method offers superior performance. We also estimate the time cost for simulating quantum supremacy experiments with our method and motivate potential improvements of the method.
References in corpus (33)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Improved Simulation of Stabilizer Circuits
- Characterizing Quantum Supremacy in Near-Term Devices
- On the reality of the quantum state
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Simulating quantum computation by contracting tensor networks
- An Introduction to QBism with an Application to the Locality of Quantum Mechanics
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Methodology for quantum logic gate constructions
- An approximate Fourier transform useful in quantum factoring
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Is the quantum state real? An extended review of -ontology theorems
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Trading classical and quantum computational resources
- Simulation of quantum circuits by low-rank stabilizer decompositions
- What limits the simulation of quantum computers?
- Instantaneous Quantum Computation
- 64-Qubit Quantum Circuit Simulation
- Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
- Classical Simulation of Quantum Supremacy Circuits
- General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
- Simulation of low-depth quantum circuits as complex undirected graphical models
- Classical Simulation of Intermediate-Size Quantum Circuits
- Sample complexity of device-independently certified "quantum supremacy"
- Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond
- On the Significance of the Gottesman-Knill Theorem
- Efficient Inner-product Algorithm for Stabilizer States
- Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
- Simulating quantum computers with probabilistic methods
- Recursive Path-Summing Simulation of Quantum Computation