Gapped and gapless phases of frustration-free spin-12 chains
Bibliographic record
Abstract
We consider a family of translation-invariant quantum spin chains with nearest-neighbor interactions and derive necessary and sufficient conditions for these systems to be gapped in the thermodynamic limit. More precisely, let ψ be an arbitrary two-qubit state. We consider a chain of n qubits with open boundary conditions and Hamiltonian Hn(ψ) which is defined as the sum of rank-1 projectors onto ψ applied to consecutive pairs of qubits. We show that the spectral gap of Hn(ψ) is upper bounded by 1/(n − 1) if the eigenvalues of a certain 2 × 2 matrix simply related to ψ have equal non-zero absolute value. Otherwise, the spectral gap is lower bounded by a positive constant independent of n (depending only on ψ). A key ingredient in the proof is a new operator inequality for the ground space projector which expresses a monotonicity under the partial trace. This monotonicity property appears to be very general and might be interesting in its own right. As an extension of our main result, we obtain a complete classification of gapped and gapless phases of frustration-free translation-invariant spin-1/2 chains with nearest-neighbor interactions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".