Quantum algorithms for classical lattice models

DOI10.1088/1367-2630/13/9/093021zbMath1451.81164arXiv1104.2517OpenAlexW3100622006WikidataQ62381968 ScholiaQ62381968MaRDI QIDQ5135901

Gemma De las Cuevas, Maarten Van den Nest, Wolfgang Dür, Miguel A. Martín-Delgado

Publication date: 24 November 2020

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.2517

Mathematics Subject Classification ID

Quantum computation (81P68) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Related Items

Unnamed Item, Low depth quantum circuits for Ising models, The complexity of approximating complex-valued Ising and Tutte partition functions, Commuting quantum circuits and complexity of Ising partition functions, Systematic study of the completeness of two-dimensional classical ϕ4 theory, Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

Cites Work

• On the exact evaluation of certain instances of the Potts partition function by quantum computers
• A new connection between quantum circuits, graphs and the Ising partition function
• Statistical physics and economics. Concepts, tools, and applications.
• An explicit universal gate-set for exchange-only quantum computation
• Quantum Computation
• Mapping all classical spin models to a lattice gauge theory
• Classical Ising model test for quantum circuits
• The BQP-hardness of approximating the Jones polynomial
• Polynomial Growth for Birational Mappings from Four-State Spin Edge Models
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
• Elements of Phase Transitions and Critical Phenomena
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item