Smith, Graeme ; Renes, Joseph ; Smolin, John (2008)
Structured Codes Improve the Bennett-Brassard-84 Quantum Key Rate.
In: Physical Review Letters, 100 (17)
doi: 10.1103/PhysRevLett.100.170502
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
A central goal in information theory and cryptography is finding simple characterizations of optimal communication rates under various restrictions and security requirements. Ideally, the optimal key rate for a quantum key distribution (QKD) protocol would be given by a single-letter formula involving optimization over a single use of an effective channel. We explore the possibility of such a formula for the simplest and most widely used QKD protocol, Bennnett-Brassard-84 with one-way classical postprocessing. We show that a conjectured single-letter formula is false, uncovering a deep ignorance about good private codes and exposing unfortunate complications in the theory of QKD. These complications are not without benefit—with added complexity comes better key rates than previously thought possible. The threshold for secure key generation improves from a bit error rate of 0.124 to 0.129
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2008 |
| Autor(en): | Smith, Graeme ; Renes, Joseph ; Smolin, John |
| Art des Eintrags: | Bibliographie |
| Titel: | Structured Codes Improve the Bennett-Brassard-84 Quantum Key Rate |
| Sprache: | Deutsch |
| Publikationsjahr: | April 2008 |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Physical Review Letters |
| Jahrgang/Volume einer Zeitschrift: | 100 |
| (Heft-)Nummer: | 17 |
| DOI: | 10.1103/PhysRevLett.100.170502 |
| Kurzbeschreibung (Abstract): | A central goal in information theory and cryptography is finding simple characterizations of optimal communication rates under various restrictions and security requirements. Ideally, the optimal key rate for a quantum key distribution (QKD) protocol would be given by a single-letter formula involving optimization over a single use of an effective channel. We explore the possibility of such a formula for the simplest and most widely used QKD protocol, Bennnett-Brassard-84 with one-way classical postprocessing. We show that a conjectured single-letter formula is false, uncovering a deep ignorance about good private codes and exposing unfortunate complications in the theory of QKD. These complications are not without benefit—with added complexity comes better key rates than previously thought possible. The threshold for secure key generation improves from a bit error rate of 0.124 to 0.129 |
| ID-Nummer: | TUD-CS-2008-11476 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik |
| Hinterlegungsdatum: | 30 Dez 2016 20:23 |
| Letzte Änderung: | 16 Mai 2018 12:47 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum