Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems

DOI10.1007/s00220-008-0574-6zbMath1159.81013arXiv0707.1894OpenAlexW3102952863WikidataQ57404233 ScholiaQ57404233MaRDI QIDQ1006295

Daniel Loss, Sergey Bravyi, David P. DiVincenzo

Publication date: 20 March 2009

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

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

Mathematics Subject Classification ID

Related Items (3)

A fast algorithm for approximating the ground state energy on a quantum computer ⋮ A short proof of stability of topological order under local perturbations ⋮ Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral gap and exponential decay of correlations
• Low-temperature phase diagrams of quantum lattice systems. I: Stability for quantum perturbations of classical systems with finitely-many ground states.
• Expansions for one quasiparticle states in spin 1/2 systems
• Low temperature phase diagrams for quantum perturbations of classical spin systems
• Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
• Time dependent theory of scattering of nucleons by nuclei
• Perturbations of ground states in weakly interacting quantum spin systems
• The Complexity of the Local Hamiltonian Problem

This page was built for publication: Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems