2026-04-17T04:23:07Zhttps://recercat.cat/oai/request

oai:recercat.cat:10230/717522025-11-05T18:54:22Zcom_2072_6col_2072_452952

00925njm 22002777a 4500 dc Cuevas, Gemma de las author Dür, W. author Van den Nest, M. author Martin-Delgado, Miguel Ángel author 2025-11-04T06:47:41Z 2025-11-04T06:47:41Z 2011 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 Z2 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. http://hdl.handle.net/10230/71752 Algorismes Computació quàntica Física Quantum algorithms for classical lattice models