Classical Ising model test for quantum circuits
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Quantum dynamics and nonequilibrium statistical mechanics (general) (82C10) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)
Abstract: We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model partition function in terms of quadratically signed weight enumerators (QWGTs), which are polynomials that arise naturally in an expansion of quantum circuits in terms of rotations involving Pauli matrices. We combine this expression with a known efficient classical algorithm for the Ising partition function of any planar graph in the absence of an external magnetic field, and the Robertson-Seymour theorem from graph theory. We give as an example a set of quantum circuits with a small number of non-nearest neighbor gates which admit an efficient classical simulation.
Recommendations
- A new connection between quantum circuits, graphs and the Ising partition function
- Low depth quantum circuits for Ising models
- Matchgates and classical simulation of quantum circuits
- Quantum algorithms for classical lattice models
- Commuting quantum circuits and complexity of Ising partition functions
Cites work
- A new connection between quantum circuits, graphs and the Ising partition function
- Fermionic linear optics revisited
- Graph minors. XX: Wagner's conjecture
- Graph-theoretic concepts in computer science. 32nd international workshop, WG 2006, Bergen, Norway, June 22--24, 2006. Revised papers
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 5320216 (Why is no real title available?)
- scientific article; zbMATH DE number 5320307 (Why is no real title available?)
- scientific article; zbMATH DE number 1270594 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 1160035 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- Lagrangian representation for fermionic linear optics
- Mathematical methods in computer science. Essays in memory of Thomas Beth
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Quantum Computability
- Quantum computations: algorithms and error correction
- Quantum computing and quadratically signed weight enumerators
- Simulating quantum systems on a quantum computer
- Simulation of topological field theories by quantum computers
- Universal Quantum Simulators
Cited in
(8)- A new connection between quantum circuits, graphs and the Ising partition function
- The complexity of approximating complex-valued Ising and Tutte partition functions
- Classical spin systems and the quantum stabilizer formalism: general mappings and applications
- Low depth quantum circuits for Ising models
- Systematic study of the completeness of two-dimensional classical \(\mathbf{\phi}^4\) theory
- Quantum algorithms for classical lattice models
- An Exact and Practical Classical Strategy for 2D Graph State Sampling
- Commuting quantum circuits and complexity of Ising partition functions
This page was built for publication: Classical Ising model test for quantum circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131403)
