The complexity of quantum spin systems on a two-dimensional square lattice
From MaRDI portal
Publication:3604064
zbMATH Open1161.81007arXivquant-ph/0504050MaRDI QIDQ3604064FDOQ3604064
Authors: Barbara M. Terhal, Roberto I. Oliveira 
Publication date: 24 February 2009
Full work available at URL: https://arxiv.org/abs/quant-ph/0504050
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
Cited In (32)
- 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
- The Bose-Hubbard model is QMA-complete
- 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
- 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 with subset state witnesses
- Complexity classification of local Hamiltonian problems
- 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
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- The complexity of translationally invariant spin chains with low local dimension
- Hamiltonian sparsification and gap-simulation
- The Complexity of the Local Hamiltonian Problem
- Epsilon-net method for optimizations over separable states
- The complexity of translationally invariant low-dimensional spin lattices in 3D
- Ground state entanglement in one-dimensional translationally invariant quantum systems
- The power of quantum systems on a line
- 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
- Simplifying quantum double Hamiltonians using perturbative gadgets
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)
