On complexity of the quantum Ising model

DOI10.1007/s00220-016-2787-4zbMath1357.82009arXiv1410.0703OpenAlexW2101031806MaRDI QIDQ507268

Sergey Bravyi, Matthew B. Hastings

Publication date: 3 February 2017

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

quantum annealingquantum Ising model

Mathematics Subject Classification ID

Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (7)

Performing fully parallel constraint logic programming on a quantum annealer ⋮ Universal qudit Hamiltonians ⋮ Unnamed Item ⋮ Toy models of holographic duality between local Hamiltonians ⋮ Complexity Classification of Local Hamiltonian Problems ⋮ Perturbation gadgets: arbitrary energy scales from a single strong interaction ⋮ Translationally invariant universal quantum Hamiltonians in 1D

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Schrieffer-Wolff transformation for quantum many-body systems
• The power of quantum systems on a line
• Monte Carlo Simulation of Quantum Spin Systems. I
• Complexity Classification of Local Hamiltonian Problems
• Quantum Phase Transitions
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Bounds for the adiabatic approximation with applications to quantum computation
• The Bose-Hubbard Model is QMA-complete
• Free parafermions
• Form-factors in the Baxter–Bazhanov–Stroganov model II: Ising model on the finite lattice
• The Complexity of the Local Hamiltonian Problem

This page was built for publication: On complexity of the quantum Ising model