Improve the efficiency of a practical quantum key distribution system
Bibliographic record
Abstract
The performance of a practical quantum key distribution (QKD) system is often limited by the multi-photon state emission of its source and the dark counts of its detectors. Here, we present two methods to improve its performance. The first method is decoy state QKD: the sender randomly sends out weak coherent states with various average photon numbers (which are named as signal state and decoy states). In [14,15], we have performed the first experimental implementation of decoy state QKD over 15km and 60km respectively, thus dramatically increasing the distance and secure key generation rate of practical QKD systems. Our work has been followed up by many research groups worldwide [16-18]. The second scheme is QKD with "dual detectors" [19]: the legitimate receiver randomly uses either a fast (but noisy) detector or a quiet (but slow) detector to measure the incoming quantum signals. The measurement results from the quiet detector can be used to upper bound the eavesdropper's information, while the measurement results from the fast detector are used to generate a secure key. We applied this idea to various QKD protocols. Simulation results demonstrated significant improvements in both BB84 protocol with ideal single photon source and Gaussian-modulated coherent states protocol.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 0.002 |
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".