Improving Gaussian channel simulation using nonunity-gain heralded quantum teleportation
Bibliographic record
Abstract
Gaussian channel simulation is an essential paradigm in understanding the evolution of bosonic quantum states. It allows us to investigate how such states are influenced by the environment and how they transmit quantum information. This makes it an essential tool for understanding the properties of Gaussian quantum communication. Quantum teleportation provides an avenue to effectively simulate Gaussian channels, such as amplifier channels, loss channels, and classically additive noise channels. However, implementations of these channels, particularly quantum amplifier channels and channels capable of performing Gaussian noise suppression, are limited by experimental imperfections and nonideal entanglement resources. In this work, we overcome these difficulties using a heralded quantum teleportation scheme that is empowered by a measurement-based noiseless linear amplifier. The noiseless linear amplification enables us to simulate a range of Gaussian channels that were previously inaccessible. In particular, we demonstrate the simulation of nonphysical Gaussian channels otherwise inaccessible using conventional means. We report Gaussian noise suppression, effectively converting an imperfect quantum channel into a near-identity channel. The performance of Gaussian noise suppression is quantified by calculating the transmitted entanglement. Published by the American Physical Society 2024
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".