Decoding quantum field theory with machine learning
Bibliographic record
Abstract
Abstract We demonstrate how one can use machine learning techniques to bypass the technical difficulties of designing an experiment and translating its outcomes into concrete claims about fundamental features of quantum fields. In practice, all measurements of quantum fields are carried out through local probes. Despite measuring only a small portion of the field, such local measurements have the capacity to reveal many of the field’s global features. This is because, when in equilibrium with their environments, quantum fields store global information locally, albeit in a scrambled way. We show that neural networks can be trained to unscramble this information from data generated from a very simple one-size-fits-all local measurement protocol. To illustrate this general claim we will consider three non-trivial features of the field as case studies: a) how, as long as the field is in a stationary state, a particle detector can learn about the field’s boundary conditions even before signals have time to propagate from the boundary to the detector, b) how detectors can determine the temperature of the quantum field even without thermalizing with it, and c) how detectors can distinguish between Fock states and coherent states even when the first and second moments of all their quadrature operators match. Each of these examples uses the exact same simple fixed local measurement protocol and machine-learning ansatz successfully. This supports the claim that the framework proposed here can be applied to nearly any kind of local measurement on a quantum field to reveal nearly any of the field’s global properties in a one-size-fits-all manner.
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.003 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".