Frustration-freeness is decidable but unprovable
quant-ph, cond-mat.stat-mech, cond-mat.str-el, cs.LO
Submitted: 2026-11-05
Updated: 2026-11-05
Comments: 8 pages + 12 pages, 2 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Efficient algorithm for a quantum analogue of 2-SAT
- Linear time algorithm for quantum 2SAT
- On polynomial grammars extended with substitution
- A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
- Parameterized Model Checking of Token-Passing Systems
- Determination of the fifth Busy Beaver value
- Tiling with Three Polygons is Undecidable
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements