Undecidability of the Spectral Gap
From MaRDI portal
Publication:5084676
DOI10.1017/fmp.2021.15OpenAlexW4285306966MaRDI QIDQ5084676
David Pérez-García, Michael M. Wolf, Toby S. Cubitt
Publication date: 28 June 2022
Published in: Forum of Mathematics, Pi (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/fmp.2021.15
Quantum computation (81P68) Undecidability and degrees of sets of sentences (03D35) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Combinatorial aspects of tessellation and tiling problems (05B45) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)
Related Items
Spectral gap and edge excitations of \(d\)-dimensional PVBS models on half-spaces ⋮ Infinite-dimensional features of matrices and pseudospectra ⋮ Undecidable problems in quantum field theory ⋮ The foundations of spectral computations via the solvability complexity index hierarchy ⋮ On the set of reduced states of translation invariant, infinite quantum systems ⋮ Some problems in density functional theory ⋮ An improved semidefinite programming hierarchy for testing entanglement ⋮ Looking at the arrow of time and loschmidt's paradox through the magnifying glass of mathematical-billiard ⋮ A quantum adiabatic algorithm for multiobjective combinatorial optimization ⋮ Gapped and gapless phases of frustration-free spin-12 chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Stability of frustration-free Hamiltonians
- The power of quantum systems on a line
- Lieb-Robinson bounds and the exponential clustering theorem
- Spectral gap and exponential decay of correlations
- Measurement-based quantum computation and undecidable logic
- The wave equation with computable initial data such that its unique solution is not computable
- Conservative logic
- Stable quasicrystalline ground states
- The complexity of translationally invariant spin chains with low local dimension
- Persistence of exponential decay and spectral gaps for interacting fermions
- More really is different
- Two soluble models of an antiferromagnetic chain
- Rigorous RG algorithms and area laws for low energy eigenstates in 1D
- Frustration free gapless Hamiltonians for matrix product states
- Undecidability and nonperiodicity for tilings of the plane
- Hofstadter butterfly as quantum phase diagram
- Colloquium: Area laws for the entanglement entropy
- Fundamental limitations in the purifications of tensor networks
- Undecidable problems: a sampler
- Equivalence of Cellular Automata to Ising Models and Directed Percolation
- Quantum Complexity Theory
- Necessary and Sufficient Conditions for Quantum Computation
- Unpredictability and undecidability in dynamical systems
- Undecidability principle and the uncertainty principle even for classical systems
- Size-driven quantum phase transitions
- A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
- The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
- Tsirelson’s problem and an embedding theorem for groups arising from non-local games
- An area law for one-dimensional quantum systems
- Topological quantum order: Stability under local perturbations
- Gapped and gapless phases of frustration-free spin-12 chains
- The stability of free fermi Hamiltonians
- The Complexity of the Local Hamiltonian Problem
- The undecidability of the domino problem
- Logical Reversibility of Computation
