MétaCan
Menu
Back to cohort

Entanglement of free Fermions on Hadamard graphs

2020· article· en· W3048714188 on OpenAlex
Nicolas Crampé, Krystal Guo, Luc Vinet

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueNuclear Physics B · 2020
Typearticle
Languageen
FieldPhysics and Astronomy
TopicQuantum many-body systems
Canadian institutionsUniversité de Montréal
FundersLuonnontieteiden ja Tekniikan Tutkimuksen ToimikuntaNatural Sciences and Engineering Research Council of Canada
KeywordsQuantum entanglementMathematicsAlgebraic numberFermionHamiltonian (control theory)Vertex (graph theory)CombinatoricsDiscrete mathematicsQuantum mechanicsPure mathematicsQuantumPhysicsGraphMathematical analysis

Abstract

fetched live from OpenAlex

Free Fermions on vertices of distance-regular graphs are considered. Bipartitions are defined by taking as one part all vertices at a given distance from a reference vertex. The ground state is constructed by filling all states below a certain energy. Borrowing concepts from time and band limiting problems, algebraic Heun operators and Terwilliger algebras, it is shown how to obtain, quite generally, a block tridiagonal matrix that commutes with the entanglement Hamiltonian. The case of the Hadamard graphs is studied in detail within that framework and the existence of the commuting matrix is shown to allow for an analytic diagonalization of the restricted two-point correlation matrix and hence for an explicit determination of the entanglement entropy.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.521
Threshold uncertainty score0.583

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.022
GPT teacher head0.229
Teacher spread0.207 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it