research
Gaussian Light Gets Computable Communication Bounds
A convex-geometry framework bounds entanglement, secret key and assisted communication under energy constraints.
Summary
A convex-geometry framework bounds entanglement, secret key and assisted communication under energy constraints.
The work derives Gaussian-restricted relative-entropy and Rains quantities, proves optimality and additivity results and supplies controlled numerical procedures. Two- and three-mode examples include matching pure-loss benchmarks. These are mathematical bounds, not a new quantum network demonstration.
Why it matters
A convex-geometry framework bounds entanglement, secret key and assisted communication under energy constraints.
Limits and context
- These are mathematical bounds, not a new quantum network demonstration.
Key claims
A convex-geometry framework bounds entanglement, secret key and assisted communication under energy constraints.
Qualification: These are mathematical bounds, not a new quantum network demonstration.
Evidence: source-2026-10-14-019
Sources
- arXiv preprint 2610.18827, original v1arXiv / submitting research authors · primary research
Corrections
No corrections have been recorded for this story.