GAUSSIAN QUANTUM INFORMATION OVER GENERAL QUANTUM KINEMATICAL SYSTEMS I: GAUSSIAN STATES
Bibliographic record
Abstract
Abstract We develop a theory of Gaussian states over general quantum kinematical systems with finitely many degrees of freedom. The underlying phase space is described by a locally compact abelian (LCA) group G with a symplectic structure determined by a 2-cocycle on G. We use the concept of Gaussian distributions on LCA groups in the sense of Bernstein to define Gaussian states and completely characterize Gaussian states over 2-regular LCA groups of the form $$G= F\times \widehat{F}$$ G = F × F ^ endowed with a canonical normalized 2-cocycle. This covers, in particular, the case of n-bosonic modes, n-qudit systems with odd $$d\ge 3$$ d ≥ 3 , and p-adic quantum systems. Our characterization reveals a topological obstruction to Gaussian state entanglement when we decompose the quantum kinematical system into the Euclidean part and the remaining part (whose phase space admits a compact open subgroup). We then generalize the discrete Hudson theorem (Gross in J Math Phys 47(12):122107, 2006) to the case of totally disconnected 2-regular LCA groups. We also examine angle-number systems with phase space $$\mathbb {T}^n\times \mathbb {Z}^n$$ T n × Z n and fermionic/hard-core bosonic systems with phase space $$\mathbb {Z}^{2n}_2$$ Z 2 2 n (which are not 2-regular) and completely characterize their Gaussian states.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 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".