Completeness of classical spin models and universal quantum computation
DOI10.1088/1742-5468/2009/07/P07001zbMath1456.82113arXiv0812.2368OpenAlexW3098308396WikidataQ62381977 ScholiaQ62381977MaRDI QIDQ3301068
Wolfgang Dür, Hans J. Briegel, Gemma De las Cuevas, Maarten Van den Nest
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.2368
Quantum computation (81P68) 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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Classical spin systems and the quantum stabilizer formalism: General mappings and applications
- Quantum Approach to Classical Statistical Mechanics
- Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
- Multiparty entanglement in graph states
- Statistical mechanics, three-dimensionality and NP-completeness
- On the computational complexity of the Jones and Tutte polynomials
This page was built for publication: Completeness of classical spin models and universal quantum computation