Large-alphabet encoding for higher-rate quantum key distribution
Author(s)
Lee, Catherine; Bunandar, Darius; Zhang, Zheshen; Steinbrecher, Gregory R.; Dixon, P. Benjamin; Wong, Franco N. C.; Shapiro, Jeffrey H; Hamilton, Scott A; Englund, Dirk R.; ... Show more Show less
DownloadPublished version (1.932Mb)
Publisher Policy
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
The manipulation of high-dimensional degrees of freedom provides new opportunities for more efficient quantum information processing. It has recently been shown that high-dimensional encoded states can provide significant advantages over binary quantum states in applications of quantum computation and quantum communication. In particular, high-dimensional quantum key distribution enables higher secret-key generation rates under practical limitations of detectors or light sources, as well as greater error tolerance. Here, we demonstrate high-dimensional quantum key distribution capabilities both in the laboratory and over a deployed fiber, using photons encoded in a high-dimensional alphabet to increase the secure information yield per detected photon. By adjusting the alphabet size, it is possible to mitigate the effects of receiver bottlenecks and optimize the secret-key rates for different channel losses. This work presents a strategy for achieving higher secret-key rates in receiver-limited scenarios and marks an important step toward high-dimensional quantum communication in deployed fiber networks.
Date issued
2019-06Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Lincoln LaboratoryJournal
Optics Express
Publisher
The Optical Society
Citation
Lee, Catherine et al. “Large-alphabet encoding for higher-rate quantum key distribution.” Optics Express, 27, 13 (June 2019): 350067 © 2019 The Author(s)
Version: Final published version
ISSN
2161-2072