Quantum key distribution implemented with d-level time-bin entangled photons
Bibliographic record
Abstract
High-dimensional photon states (qudits) are pivotal to enhance the information capacity, noise robustness, and data rates of quantum communications. Time-bin entangled qudits are promising candidates for implementing high-dimensional quantum communications over optical fiber networks with processing rates approaching those of classical telecommunications. However, their use is hindered by phase instability, timing inaccuracy, and low scalability of interferometric schemes needed for time-bin processing. As well, increasing the number of time bins per photon state typically requires decreasing the repetition rate of the system, affecting in turn the effective qudit rates. Here, we demonstrate a fiber-pigtailed, integrated photonic platform enabling the generation and processing of picosecond-spaced time-bin entangled qudits in the telecommunication C band via an on-chip interferometry system. We experimentally demonstrate the Bennett-Brassard-Mermin 1992 quantum key distribution protocol with time-bin entangled qudits and extend it over a 60 km-long optical fiber link, by showing dimensionality scaling without sacrificing the repetition rate. Our approach enables the manipulation of time-bin entangled qudits at processing speeds typical of standard telecommunications (10 s of GHz) with high quantum information capacity per single frequency channel, representing an important step towards an efficient implementation of high-data rate quantum communications in standard, multi-user optical fiber networks.
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.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".