Quantum algorithms for spin models and simulable gate sets for quantum computation

  title={Quantum algorithms for spin models and simulable gate sets for quantum computation},
  author={Maarten Van den Nest and Wolfgang Dur and Robert Raussendorf and Hans J. Briegel},
  journal={Physical Review A},
We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vertex model as well as a two-dimensional Ising-type model. We show that classically simulating these (complex-parameter) spin models is as hard as simulating universal quantum computation, i.e., BQP… 

Figures from this paper

Quantum algorithms for classical lattice models
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
A quantum information approach to statistical mechanics
We review some connections between quantum information and statistical mechanics. We focus on three sets of results for classical spin models. First, we show that the partition function of all
Normalizer Circuits and Quantum Computation
An efficient formalism for simulating families of quantum circuits, that are non-universal but comprise important quantum gates such as QFT or CNOT, is developed and used to design new algorithms that provide quantum speedups.
Commuting quantum circuits and complexity of Ising partition functions
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal. Nevertheless, it has been shown that if
Computing partition functions in the one-clean-qubit model
It is proved that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that the method provides a super-polynomial speedup for certain parameter values.
Solving search problems by strongly simulating quantum circuits
This article shows that strong simulation algorithms perform another fundamental task: solving search problems, and enhances the utility of strong simulation methods and extends the class of search problems known to be efficiently simulable.
Measuring complex-partition-function zeros of Ising models in quantum simulators
Studying the zeros of partition functions in the space of complex control parameters allows one to understand formally how critical behavior of a many-body system can arise in the thermodynamic limit
Title Commuting quantum circuits and complexity of Ising partitionfunctions
Instantaneous quantumpolynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal. Nevertheless, it has been shown that if
Quantum circuits and low-degree polynomials over F2
This work explores a correspondence between quantum circuits and low-degree polynomials over the finite field F2 and gives proofs of classical hardness results based on quantum circuit concepts and finds efficient classical simulation algorithms for certain classes of quantum circuits based on efficient algorithms for classes of polynomers.


Quantum Circuits That Can Be Simulated Classically in Polynomial Time
It is shown that two-bit operations characterized by 4 × 4 matrices in which the sixteen entries obey a set of five polynomial relations can be composed according to certain rules to yield a class of circuits that can be simulated classically in polynometric time.
Classical spin models and the quantum-stabilizer formalism.
We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. More precisely, we
Classical simulation of noninteracting-fermion quantum circuits
It is shown that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension.
Completeness of the classical 2D Ising model and universal quantum computation.
We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the
Matchgates and classical simulation of quantum circuits
  • R. Jozsa, A. Miyake
  • Physics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2008
Let G(A, B) denote the two-qubit gate that acts as the one-qubit SU(2) gates A and B in the even and odd parity subspaces, respectively, of two qubits. Using a Clifford algebra formalism, we show
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
It is concluded with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a #P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the TuttePolynomial and graph coloring.
Statistical mechanical models and topological color codes
We find that the overlap of a topological quantum color-code state, representing a quantum memory, with a factorized state of qubits can be written as the partition function of a three-body classical
Measurement-based quantum computation with the toric code states
We study measurement-based quantum computation (MQC) using as a quantum resource the planar code state on a two-dimensional square lattice (planar analog of the toric code). It is shown that MQC with
An Explicit Universal Gate-Set for Exchange-Only Quantum Computation
This work presents the exact specification of a discrete universal logical gate-set on four-qubit arrays and shows how to implement the single qubit operations exactly and generate the encoded controlled-NOT with 27 parallel nearest neighbor exchange interactions or 50 serial gates, obtained from extensive numerical optimization using genetic algorithms and Nelder–Mead searches.
On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
It is demonstrated that for a certain class of sparse graphs, which the authors call Irreducible Cyclic Cocycle Code (ICCCε) graphs, quantum computers provide a polynomial speed up in the difference between the number of edges and vertices of the graph, and an exponential speedup in q, over the best classical algorithms known to date.