Satellites promise global-scale quantum networks
Bibliographic record
Abstract
Academia, governments, and industry around the world are on a quest to build long-distance quantum communication networks for a future quantum internet. Using air and fiber channels, quantum communication quickly faced the daunting challenge of exponential photon loss with distance. Quantum repeaters were invented to solve the loss problem by probabilistically establishing entanglement over short distances and using quantum memories to synchronize the teleportation of such entanglement to long distances. However, due to imperfections and complexities of quantum memories, ground-based proof-of-concept repeater demonstrations have yet been restricted to metropolitan-scale distances. In contrast, direct photon transmission from satellites through empty space faces almost no exponential absorption loss and only quadratic beam divergence loss. A single satellite successfully distributed entanglement over more than 1,200 km. It is becoming increasingly clear that quantum communication over large intercontinental distances (e.g., 4,000–20,000 km) will likely employ a satellite-based architecture. This could involve quantum memories and repeater protocols in satellites, or memory-less satellite-chains through which photons are simply reflected, or some combination thereof. Rapid advancements in the space launch and classical satellite communications industry provide a strong tailwind for satellite quantum communication, promising economical and easier deployment of quantum communication satellites.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.007 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.020 | 0.004 |
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".