Quantum Hamiltonian Complexity
From MaRDI portal
Publication:3451340
DOI10.1561/0400000066zbMath1329.68117arXiv1401.3916OpenAlexW2116015765MaRDI QIDQ3451340
Sevag Gharibian, Zeph A. Landau, Yichen Huang, Seung Woo Shin
Publication date: 16 November 2015
Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3916
ground stateNP-completenesssatisfiability problemquantum Hamiltonian complexityquantum Merlin-Arthur-complete problem
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (24)
Two-dimensional local Hamiltonian problem with area laws is \textsf{QMA}-complete ⋮ Circuit complexity in interacting QFTs and RG flows ⋮ Ground State Connectivity of Local Hamiltonians ⋮ Quantum Gibbs samplers: the commuting case ⋮ Action growth for AdS black holes ⋮ Quantum Max-flow/Min-cut ⋮ Complexity of quantum impurity problems ⋮ Complexity of formation in holography ⋮ Circuit complexity for free fermions ⋮ The complexity of translationally invariant spin chains with low local dimension ⋮ Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture ⋮ Time evolution of complexity: a critique of three methods ⋮ Comments on holographic complexity ⋮ Entropy constraints for ground energy optimization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Surface counterterms and regularized holographic complexity ⋮ Liouville action as path-integral complexity: from continuous tensor networks to AdS/CFT ⋮ Entanglement and correlation functions of the quantum Motzkin spin-chain ⋮ Universal eigenstate entanglement of chaotic local Hamiltonians ⋮ Approximation algorithms for quantum many-body problems ⋮ On efficiently solvable cases of quantum \(k\)-SAT ⋮ Faster ground state preparation and high-precision ground energy estimation with fewer qubits ⋮ Unnamed Item
This page was built for publication: Quantum Hamiltonian Complexity
