Unconditionally secure key distillation from multiphotons
Bibliographic record
Abstract
In this paper, we prove that the unconditionally secure key can be surprisingly extracted from multiphoton emission part in the photon polarization-based quantum key distribution. One example is shown by explicitly proving that one can indeed generate an unconditionally secure key from Alice's two-photon emission part proposed by Scarani [ et al. Phys. Rev. Lett. 92, 057901 (2004)]. Which is called the Scarani-Acin-Ribordy-Gisin (SARG04) protocol. This protocol uses the same four states as in Bennett-Brassard 1984 (BB84) and differs only in the classical postprocessing protocol. It is, thus, interesting to see how the classical postprocessing of quantum key distribution might qualitatively change its security. We also show that one can generate an unconditionally secure key from the single to the four-photon part in a generalized SARG04 protocol that uses six states. Finally, we also compare the bit error rate threshold of these protocols with the one in the BB84 protocol and the original six-state protocol assuming a depolarizing channel.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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".