Publication:3448820: Difference between revisions
From MaRDI portal
Publication:3448820
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Ground State Connectivity of Local Hamiltonians to Ground State Connectivity of Local Hamiltonians: Duplicate |
(No difference)
| |
Latest revision as of 16:00, 2 May 2024
DOI10.1007/978-3-662-47672-7_50zbMath1440.68097arXiv1409.3182OpenAlexW2800846823WikidataQ114071277 ScholiaQ114071277MaRDI QIDQ3448820
Publication date: 27 October 2015
Published in: ACM Transactions on Computation Theory, Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.3182
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
On the parameterized complexity of reconfiguration of connected dominating sets, Ground State Connectivity of Local Hamiltonians, Token sliding on graphs of girth five, Galactic token sliding, Token sliding on graphs of girth five, Unnamed Item, Unnamed Item, On girth and the parameterized complexity of token sliding and Token Jumping, Shorter unentangled proofs for ground state connectivity, Introduction to reconfiguration, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconfiguration of list edge-colorings in a graph
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Fault-tolerant quantum computation by anyons
- Connectedness of the graph of vertex-colourings
- Complexity Classification of Local Hamiltonian Problems
- Hardness of Approximation for Quantum Problems
- Finding paths between 3-colorings
- Ground State Connectivity of Local Hamiltonians
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
- Quantum Hamiltonian Complexity
- Coding theorem and strong converse for quantum channels
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
