The Complexity of the Local Hamiltonian Problem
From MaRDI portal
Recommendations
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP
- Complexity classification of local Hamiltonian problems
- The complexity of quantum spin systems on a two-dimensional square lattice
- Complexity of stoquastic frustration-free Hamiltonians
Cited in
(87)- Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- The complexity of translationally invariant spin chains with low local dimension
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Two-dimensional local Hamiltonian problem with area laws is \textsf{QMA}-complete
- Constant-round blind classical verification of quantum sampling
- A variational principle for ground spaces
- Estimating the ground state energy of the Schrödinger equation for convex potentials
- Perturbation gadgets: arbitrary energy scales from a single strong interaction
- Verification of quantum computation: an overview of existing approaches
- Approximating ground and excited state energies on a quantum computer
- Improved gap estimates for simulating quantum circuits by adiabatic evolution
- Quantum simulation of quantum field theories as quantum chemistry
- Universal qudit Hamiltonians
- Total functions in QMA
- Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
- Complexity classification of local Hamiltonian problems
- Quantum 3-SAT Is QMA₁-complete
- Hardness of approximation for quantum problems
- Ground-state spaces of frustration-free Hamiltonians
- Quantum walks on necklaces and mixing
- An introduction to quantum annealing
- Complexity of commuting Hamiltonians on a square lattice of qubits
- Unifying variational methods for simulating quantum many-body systems
- Approximation algorithms for QMA-complete problems
- scientific article; zbMATH DE number 6351479 (Why is no real title available?)
- Connecting the probability distributions of different operators and generalization of the Chernoff-Hoeffding inequality
- Asymptotic behavior of macroscopic observables in generic spin systems
- The Kitaev-Feynman clock for open quantum systems
- Perturbative 2-body parent Hamiltonians for projected entangled pair states
- Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
- Testing quantum circuits and detecting insecure encryption
- On quantum algorithm for binary search and its computational complexity
- Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete
- Two QCMA-complete problems
- Commutative version of the local Hamiltonian problem and common eigenspace problem
- The complexity of stoquastic local Hamiltonian problems
- New construction for a QMA complete three-local Hamiltonian
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Complexity of stoquastic frustration-free Hamiltonians
- Perfect, efficient, state transfer and its application as a constructive tool
- Consistency of Local Density Matrices Is QMA-Complete
- The complexity of quantum spin systems on a two-dimensional square lattice
- Entanglement in pure and thermal cluster states
- The complexity of translationally invariant low-dimensional spin lattices in 3D
- scientific article; zbMATH DE number 6866233 (Why is no real title available?)
- THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP
- Realizable Hamiltonians for universal adiabatic quantum computers
- Hypergraph Ramsey numbers and adiabatic quantum algorithm
- Epsilon-net method for optimizations over separable states
- On efficiently solvable cases of quantum k-SAT
- On complexity of the quantum Ising model
- Dynamical structure factors of dynamical quantum simulators
- Undecidability of the Spectral Gap
- Hamiltonian sparsification and gap-simulation
- Toric codes and quantum doubles from two-body Hamiltonians
- Error-transparent evolution: the ability of multi-body interactions to bypass decoherence
- Self-correcting quantum computers
- The Bose-Hubbard model is QMA-complete
- Ground state entanglement in one-dimensional translationally invariant quantum systems
- Fast universal quantum computation with railroad-switch local Hamiltonians
- A fast algorithm for approximating the ground state energy on a quantum computer
- On the coalescence time of reversible random walks
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- The theory of variational hybrid quantum-classical algorithms
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- The quantum complexity of computing Schatten p-norms
- Product-state approximations to quantum states
- A study of heuristic guesses for adiabatic quantum computation
- Schrieffer-Wolff transformation for quantum many-body systems
- Homotopy of periodic 2 2 matrices
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- Circuit complexity through phase transitions: consequences in quantum state preparation
- Interactive oracle arguments in the QROM and applications to succinct verification of quantum computation
- Zero-knowledge proof systems for QMA
- Circuit lower bounds for low-energy states of quantum code Hamiltonians
- Triangulated relativistic quantum computation: a curvature-modulated unification of quantum and relativistic computing
- Topological classification of insulators. I: Non-interacting spectrally-gapped one-dimensional systems
- Commuting local Hamiltonian problem on 2D beyond qubits
- Noncontextual Pauli Hamiltonians
- Absence of Barren plateaus and scaling of gradients in the energy optimization of isometric tensor network states
- Investigating and mitigating barren plateaus in variational quantum circuits: a survey
- Quantum data sketches
- Classical algorithms for constant approximation of the ground state energy of local Hamiltonians
- The power of quantum systems on a line
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Tensor network contractions for \#SAT
This page was built for publication: The Complexity of the Local Hamiltonian Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470726)
