Related papers: Quantum algorithms for classical lattice models

We solve a 4-(bond)-vertex model on an ensemble of 3-regular Phi3 planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The method of solution, by mapping onto an Ising model in field, is inspired by…

We review and analyze the hybrid quantum-classical NMR computing methodology referred to as Type-II quantum computing. We show that all such algorithms considered so far within this paradigm are equivalent to some classical…

This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…

We study the complexity of approximating the partition function of the $q$-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters. Apart from the classical connections with quantum…

The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms…

We prove a complete complexity classification theorem for the planar eight-vertex model. For every parameter setting in ${\mathbb C}$ for the eight-vertex model, the partition function is either (1) computable in P-time for every graph, or…

In this paper we look at 3D lattice models that are generalizations of the state sum model used to define the Kuperberg invariant of 3-manifolds. The partition function is a scalar constructed as a tensor network where the building blocks…

The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice…

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…

We construct colored lattice models whose partition functions represent symplectic and odd orthogonal Demazure characters and atoms. We show that our lattice models are not solvable, but we are able to show the existence of sufficiently…

We propose that scaling dimensions of d=3 conformal field theories can be studied on a system of qubits with near term quantum simulation platforms. Our proposal chooses couplings of quantum many-body problems on a polyhedral lattice at…

Quantum computing is a winsome field that concerns with the behaviour and nature of energy at the quantum level to improve the efficiency of computations. In recent years, quantum computation is receiving much attention for its capability…

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected running-time that is almost linear in $(M/(\epsilon_{\rm…

While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…

There is no an accepted exact partition function (PF) for the three dimensional (3D) Ising model to our knowledge. Mainly based on the connection between the lattice Green function (LGF) for the simple cubic lattice and that for the…

There is no an accepted exact partition function (PF) for the two-dimensional (2D) Ising model with a non-zero external magnetic field to our knowledge. Here we infer an empirical PF for such an Ising model. We compare the PFs for two…

We evaluate using programmable superconducting flux qubit D-Wave quantum annealers to approximate the partition function of Ising models. We propose the use of two distinct quantum annealer sampling methods: chains of Monte Carlo-like…

The study of real-time evolution of lattice quantum field theories using classical computers is known to scale exponentially with the number of lattice sites. Due to a fundamentally different computational strategy, quantum computers hold…

A simple formulation of an exactly integrable $q$-oscillator model on two dimensional lattice (in 2+1 dimensional space-time) is given. Its interpretation in the terms of 2d quantum inverse scattering method and nested Bethe Ansatz…

We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…