The complexity of quantum spin systems on a two-dimensional square lattice

zbMATH Open1161.81007arXivquant-ph/0504050MaRDI QIDQ3604064FDOQ3604064

Roberto I. Oliveira, Barbara M. Terhal

Publication date: 24 February 2009

Full work available at URL: https://arxiv.org/abs/quant-ph/0504050

Cited In (28)

Fast universal quantum computation with railroad-switch local Hamiltonians
Complexity Invariance by Replication in the Quantum Square Well
Classifying data using near-term quantum devices
Product-state approximations to quantum states
Undecidability of the Spectral Gap
Toric codes and quantum doubles from two-body Hamiltonians
Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory
Decomposition of the Fock space in two-dimensional square lattice systems
Title not available (Why is that?)
On the time dependence of holographic complexity in a dynamical Einstein-Dilaton model
Two-dimensional local Hamiltonian problem with area laws is \textsf{QMA}-complete
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
Complexity classification of local Hamiltonian problems
QMA with Subset State Witnesses
Perturbative 2-body parent Hamiltonians for projected entangled pair states
Adiabatic graph-state quantum computation
Universal qudit Hamiltonians
On complexity of the quantum Ising model
Ground State Connectivity of Local Hamiltonians
The complexity of translationally invariant spin chains with low local dimension
Epsilon-net method for optimizations over separable states
Ground state entanglement in one-dimensional translationally invariant quantum systems
Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
Schrieffer-Wolff transformation for quantum many-body systems
Holographic duality between local Hamiltonians from random tensor networks

   Recommendations

The Complexity of the Local Hamiltonian Problem 👍 👎
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science 👍 👎
Complexity classification of local Hamiltonian problems 👍 👎
THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP 👍 👎
The complexity of translationally invariant spin chains with low local dimension 👍 👎

This page was built for publication: The complexity of quantum spin systems on a two-dimensional square lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604064)