The computation of classical Ising partition functions, coming from statistical physics, is a natural generalization of binary optimization. This is a notoriously hard problem in general, which makes it an especially interesting task to consider in the search for practical quantum advantage in near term quantum computers. In this work we view classical Ising models (on certain graphs) as quantum imaginary time evolution, which is enabled by the use of the transfer matrix mapping. We study this mapping from two points of view: (1) following Onsager and Kaufman’s original solution of the 2D Ising model, which serves as a starting point, we consider more general models and the possibility of a similar Lie-theoretic solution; (2) we consider quantum algorithms for the computation of partition functions and thermal averages via transfer matrices, which can be implemented either with block encodings inside larger unitaries or by approximating the state trajectories with unitary operators.
The computation of classical Ising partition functions, coming from statistical physics, is a natural generalization of binary optimization. This is a notoriously hard problem in general, which makes it an especially interesting task to consider in the search for practical quantum advantage in near term quantum computers. In this work we view classical Ising models (on certain graphs) as quantum imaginary time evolution, which is enabled by the use of the transfer matrix mapping. We study this mapping from two points of view: (1) following Onsager and Kaufman’s original solution of the 2D Ising model, which serves as a starting point, we consider more general models and the possibility of a similar Lie-theoretic solution; (2) we consider quantum algorithms for the computation of partition functions and thermal averages via transfer matrices, which can be implemented either with block encodings inside larger unitaries or by approximating the state trajectories with unitary operators.
We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence of an inhomogeneous magnetic field, can specialize to the partition function of any Ising system on an arbitrary graph. In this sense the 2D Ising model is said to be "complete". However, in order to obtain the above result, the coupling strengths on the 2D lattice must assume complex values, and thus do not allow for a physical interpretation. Here we show how a complete model with real -and, hence, "physical"- couplings can be obtained if the 3D Ising model is considered. We furthermore show how to map general q-state systems with possibly many-body interactions to the 2D Ising model with complex parameters, and give completeness results for these models with real parameters. We also demonstrate that the computational overhead in these constructions is in all relevant cases polynomial. These results are proved by invoking a recently found cross-connection between statistical mechanics and quantum information theory, where partition functions are expressed as quantum mechanical amplitudes. Within this framework, there exists a natural correspondence between many-body quantum states that allow universal quantum computation via local measurements only, and complete classical spin systems.
In the algebraic formulation of the Ising model, the partition function is expressed as the trace of a power VM of the transfer operator V, or equivalently, as the sum of Mth powers of the eigenvalues of V. In the derivations of Kaufman, Onsager, and more recently of Schultz, Mattis, and Lieb (SML), the transfer operator is first reduced to a more amenable form for computation and then, in principle at least, diagonalized. For the infinite lattice, only the largest eigenvalue of V is needed, and this is all Onsager and SML compute. Kaufman finds all the eigenvalues and is thus able to write down the partition function for the finite lattice. In the present work we give an alternative derivation of the SML form for V, and show how the Kaufman result can be obtained from this form without actual diagonalization. Instead of diagonalizing V, the evaluation of the trace is done directly after assigning a simple representation to V.
We investigate quantum-computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the overlap mapping developed by M. Van den Nest, W. D\"ur, and H. J. Briegel [Phys. Rev. Lett. 98, 117207 (2007)] and its interpretation through measurement-based quantum computation (MBQC). We specify an algorithmic domain, on which the proposed algorithm works, and an approximation scale, which determines the accuracy of the approximation. We show that the proposed algorithm performs a nontrivial task, which would be intractable on any classical computer, by showing that the problem that is solvable by the proposed quantum algorithm is BQP-complete. In the construction of the BQP-complete problem coupling strengths and magnetic fields take complex values. However, the Ising models that are of central interest in statistical physics and computer science consist of real coupling strengths and magnetic fields. Thus we extend the algorithmic domain of the proposed algorithm to such a real physical parameter region and calculate the approximation scale explicitly. We found that the overlap mapping and its MBQC interpretation improve the approximation scale exponentially compared to a straightforward constant-depth quantum algorithm. On the other hand, the proposed quantum algorithm also provides partial evidence that there exist no efficient classical algorithm for a multiplicative approximation of the Ising partition functions even on the square lattice. This result supports the observation that the proposed quantum algorithm also performs a nontrivial task in the physical parameter region.
Computing the partition function of the Ising model on a graph has been investigated from both sides of computer science and statistical physics, with producing fertile results of P cases, FPTAS/FPRAS cases, inapproximability and intractability. Recently, measurement-based quantum computing as well as quantum annealing open up another bridge between two fields by relating a tree tensor network representing a quantum graph state to a rank decomposition of the graph. This paper makes this bridge wider in both directions. An O∗(22ωbw(G))-time algorithm is developed for the partition function on n-vertex graph G with branch decomposition of width bw(G), where O* ignores a polynomial factor in n and ω is the matrix multiplication parameter less than 2.37287. Related algorithms of O∗(4rw(G~)) time for the tree tensor network are given which are of interest in quantum computation, given rank decomposition of a subdivided graph G~ with width rw(G~). These algorithms are parameter-exponential, i.e., O*(cp) for constant c and parameter p, and such an algorithm is not known for a more general case of computing the Tutte polynomial in terms of bw(G) (the current best time is O*(min{2n, bw(G)O(bw(G))})) with a negative result in terms of the clique-width, related to the rank-width, under ETH.
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 there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy collapses to the third level, which is highly implausible. However, the origin of the classical intractability is still less understood. Here we establish a relationship between IQP and computational complexity of calculating the imaginary-valued partition functions of Ising models. We apply the established relationship in two opposite directions. One direction is to find subclasses of IQP that are classically efficiently simulatable by using exact solvability of certain types of Ising models. Another direction is applying quantum computational complexity of IQP to investigate (im)possibility of efficient classical approximations of Ising partition functions with imaginary coupling constants. Specifically, we show that a multiplicative approximation of Ising partition functions is #P-hard for almost all imaginary coupling constants even on planar lattices of a bounded degree.
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 3D 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 by Van den Nest et al (2009 Phys.Rev. A 80 052334) and extended here.