Quantum algorithms for classical lattice models
From MaRDI portal
Abstract: We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D square lattice, and (iv) the Z_2 lattice gauge theory on a three-dimensional square lattice. Moreover, we prove that these problems are BQP-complete, that is, that estimating these partition functions is as hard as simulating arbitrary quantum computation. The results are proven for a complex parameter regime of the models. The proofs are based on a mapping relating partition functions to quantum circuits introduced in [Van den Nest et al., Phys. Rev. A 80, 052334 (2009)] and extended here.
Recommendations
- Low depth quantum circuits for Ising models
- Efficient algorithms for approximating quantum partition functions
- Quantum computation and the evaluation of tensor networks
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
- Commuting quantum circuits and complexity of Ising partition functions
Cites work
- A new connection between quantum circuits, graphs and the Ising partition function
- An explicit universal gate-set for exchange-only quantum computation
- Both Toffoli and Controlled-NOT need little help to universal quantum computing
- Classical Ising model test for quantum circuits
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
- Elements of phase transitions and critical phenomena
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 921439 (Why is no real title available?)
- Mapping all classical spin models to a lattice gauge theory
- On a certain fractional q-difference and its eigen function
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
- Quantum computation
- Statistical physics and economics. Concepts, tools, and applications.
- The BQP-hardness of approximating the Jones polynomial
- The Jones polynomial: quantum algorithms and applications in quantum complexity theory
Cited in
(18)- Quantum lattice enumeration and tweaking discrete pruning
- The complexity of approximating complex-valued Ising and Tutte partition functions
- Quantum algorithms for variants of average-case lattice problems via filtering
- Quantum vs. classical algorithms for solving the heat equation
- scientific article; zbMATH DE number 5953237 (Why is no real title available?)
- Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs
- Completeness of classical spin models and universal quantum computation
- scientific article; zbMATH DE number 7228448 (Why is no real title available?)
- Low depth quantum circuits for Ising models
- Systematic study of the completeness of two-dimensional classical \(\mathbf{\phi}^4\) theory
- Numerical simulations of quantum statistical mechanical models
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- Classical Ising model test for quantum circuits
- Quantum computation and the evaluation of tensor networks
- Efficient algorithms for approximating quantum partition functions
- Commuting quantum circuits and complexity of Ising partition functions
- Calculation of partition function of Ising model on quantum computer
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
This page was built for publication: Quantum algorithms for classical lattice models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5135901)
