Topological and error-correcting properties for symmetry-protected topological order
Bibliographic record
Abstract
We study the symmetry-protected topological (SPT) orders for bosonic systems from an information-theoretic viewpoint. We show that with a proper choice of the onsite basis, the degenerate ground-state space of SPT orders (on a manifold with boundary) is a quantum error-correcting code with macroscopic classical distance, hence is stable against any local bit-flip errors. We show that this error-correcting property of the SPT orders has a natural connection to that of the symmetry-breaking orders, whose degenerate ground-state space is a classical error-correcting code with a macroscopic distance, providing a new angle for the hidden symmetry-breaking properties in SPT orders. We further propose new types of topological entanglement entropy that probe the SPT orders hidden in their symmetric ground states, which also signal the topological phase transitions protected by symmetry. Combined with the original definition of topological entanglement entropy that probes the “intrinsic topological orders”, and the recent proposed one that probes the symmetry-breaking orders, the set of different types of topological entanglement entropy may hence distinguish topological orders, SPT orders, and symmetry-breaking orders, which may be mixed up in a single system.
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.000 | 0.003 |
| 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.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".