Low depth quantum circuits for Ising models
From MaRDI portal
Publication:339445
DOI10.1016/j.aop.2013.11.001zbMath1348.81139arXiv1208.3918OpenAlexW3100391894WikidataQ62109116 ScholiaQ62109116MaRDI QIDQ339445
M. Cirio, O. Boada, Gavin K. Brennen, Sofyan Iblisdir
Publication date: 11 November 2016
Published in: Annals of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.3918
Quantum computation (81P68) Circuits, networks (94C99) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (2)
The complexity of approximating complex-valued Ising and Tutte partition functions ⋮ Commuting quantum circuits and complexity of Ising partition functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
- Polynomial-Time Approximation Algorithms for the Ising Model
- The Complexity of Ferromagnetic Ising with Local Fields
- On Lattices Admitting Unique Lagrange Interpolations
- On the computational complexity of the Jones and Tutte polynomials
- Classical Ising model test for quantum circuits
- Quantum algorithms for classical lattice models
- Quantum Computation and the Evaluation of Tensor Networks
- A polynomial quantum algorithm for approximating the Jones polynomial
This page was built for publication: Low depth quantum circuits for Ising models