Physics · the experiment
Beyond proof
A grid of quantum spins, one rule between neighbours, a cutoff no one can compute. Four questions, from beginner to expert, on what can be decided and what can be proved.
1 · Say what the first theorem proves
Beginner
For a fixed spin size, how can you know whether a model is frustration-free on grids of every size?
2 · Read a larger grid
Open boundaries (the grid simply stops at its edges). A computer finds a model frustration-free on a 40 × 40 grid, but frustrated on a 41 × 41 grid.
Intermediate
What can you say about the 100 × 100 grid?
3 · Follow the chain of the tiles
The paper's special model is frustration-free exactly when its tiles can cover the infinite plane, that is, exactly when a program hunting for a contradiction in the axioms of mathematics (ZFC) never stops.
Expert
Suppose a computer found this model frustrated on some finite grid. What would follow?
4 · Judge how quantum the model is
For the energy-gap question, undecidability relies on encoding a computation in the phases of quantum interactions.
Expert
Does the unprovable frustration-free model need truly quantum effects?
At the edge of proof
—