Classical Ising model test for quantum circuits
From MaRDI portal
Publication:5131403
DOI10.1088/1367-2630/12/7/075026zbMath1445.82004arXiv0902.4889OpenAlexW3103241859WikidataQ125909413 ScholiaQ125909413MaRDI QIDQ5131403
Joseph Geraci, Daniel A. Lidar
Publication date: 7 November 2020
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.4889
Planar graphs; geometric and topological aspects of graph theory (05C10) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Quantum dynamics and nonequilibrium statistical mechanics (general) (82C10)
Related Items
Low depth quantum circuits for Ising models, The complexity of approximating complex-valued Ising and Tutte partition functions, Commuting quantum circuits and complexity of Ising partition functions, Systematic study of the completeness of two-dimensional classical ϕ4 theory, Quantum algorithms for classical lattice models
Cites Work
- Graph minors. XX: Wagner's conjecture
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
- Graph-theoretic concepts in computer science. 32nd international workshop, WG 2006, Bergen, Norway, June 22--24, 2006. Revised papers
- A new connection between quantum circuits, graphs and the Ising partition function
- Quantum computing and quadratically signed weight enumerators
- Simulation of topological field theories by quantum computers
- Fermionic linear optics revisited
- Mathematical methods in computer science. Essays in memory of Thomas Beth
- Universal Quantum Simulators
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Simulating quantum systems on a quantum computer
- Quantum computations: algorithms and error correction
- Quantum Computability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
