UNIVERSITY OF CALGARY Real world quantum cryptography
Bibliographic record
Abstract
Quantum cryptography uses the quantum properties of individual photons to provide two or more users with means to communicate securely and efficiently. Specifically, quantum key distribution (QKD) focuses on the secure communication between two distant parties and guarantees the security of a transmitted message between them. Although QKD is the most mature application of quantum cryptography, applications of quantum mechanics in communication systems are not limited to QKD and other cryptographic protocols can be implemented as well. This thesis focuses on the implementation of quantum cryptographic systems over de-ployed fiber. A first QKD system was built and used to demonstrate the BB84 protocol over deployed fiber between the University of Calgary and SAIT. The system implemented a novel tool called quantum frames that allow for the quantum signals to be routed, for clock syn-chronization, and for channel stabilization in a network scenario. The same system was used to examine the scalability of the secret key generation rate in different steps of the process in order to detect potential bottlenecks for key generation rate of high speed systems. A sec-
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.003 | 0.002 |
| Scholarly communication | 0.004 | 0.002 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.004 |
| Insufficient payload (model declined to judge) | 0.071 | 0.017 |
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".