All phase-space linear bosonic channels are approximately Gaussian dilatable
Bibliographic record
Abstract
We compare two sets of multimode quantum channels acting on a finite collection of harmonic oscillators: (a) the set of linear bosonic channels, whose action is described as a linear transformation at the phase space level; and (b) Gaussian dilatable channels, that admit a Stinespring dilation involving a Gaussian unitary. Our main result is that the set (a) coincides with the closure of (b) with respect to the strong operator topology. We also present an example of a channel in (a) which is not in (b), implying that taking the closure is in general necessary. This provides a complete resolution to the conjecture posed in Sabapathy and Winter (2017 Phys. Rev. A 95 062309). Our proof technique is constructive, and yields an explicit procedure to approximate a given linear bosonic channel by means of Gaussian dilations. It turns out that all linear bosonic channels can be approximated by a Gaussian dilation using an ancilla with the same number of modes as the system. We also provide an alternative dilation where the unitary is fixed in the approximating procedure. Our results apply to a wide range of physically relevant channels, including all Gaussian channels such as amplifiers, attenuators, phase conjugators, and also non-Gaussian channels such as additive noise channels and photon-added Gaussian channels. The method also provides a clear demarcation of the role of Gaussian and non-Gaussian resources in the context of linear bosonic channels. Finally, we also obtain independent proofs of classical results such as the quantum Bochner theorem, and develop some tools to deal with convergence of sequences of quantum channels on continuous variable systems that may be of independent interest.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.002 | 0.003 |
| 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".