Comprehensive high-speed reconciliation for continuous-variable quantum key distribution
- PDF / 914,377 Bytes
- 19 Pages / 439.37 x 666.142 pts Page_size
- 60 Downloads / 234 Views
Comprehensive high-speed reconciliation for continuous-variable quantum key distribution Dabo Guo1 · Chao He1 · Tianhao Guo1 · Zhe Xue1 · Qiang Feng1 · Jianjian Mu1 Received: 9 March 2020 / Accepted: 18 August 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Reconciliation is currently the bottleneck of continuous-variable quantum key distribution systems for its great influence on the key rate and the distance of systems. In this paper, we address the increase in key rates by accelerating the speed of reconciliation algorithms based on the protocol of sliced error correction on a heterogeneous computing structure (a GPGPU card (general purpose graphics processing units will be abbreviated as GPU in this paper) and a general CPU) in the framework of Open Computing Language (OpenCL) (OpenCL is a programming framework based on C language). A block length of its component codes of low-density parity-check (LDPC) codes up to 217 bits is employed in order to achieve a higher reconciliation efficiency. To meet the requirements of the OpenCL specifications, we designed a data structure, namely static cross bi-directional circular linked list, to store a super large sparse check matrix of the LDPC codes. Such a configuration ensures the practicability of our system, i.e. a better trade-off between the speed and net key rates of the reconciliation. The speed of the proposed reconciliation scheme reaches about 70.1 Mb/s with 512 codewords decoding in parallel, approximately 3600 times faster than that with the platform with only a CPU. Keywords CVQKD · Reconciliation · High-speed · Heterogeneous computing
1 Introduction Quantum key distribution (QKD) allows two distant legitimate parties (Alice and Bob) to establish an unconditional secret key for cryptographic purpose even in the presence of an eavesdropper (Eve) [1,2]. Since the seminal work of Bennett and Brassard [3] in 1984, many QKD protocols have been developed [4]. There are two kinds of
B 1
Dabo Guo [email protected] College of Physics and Electronic Engineering, Shanxi University, Taiyuan 030006, China 0123456789().: V,-vol
123
320
Page 2 of 19
D. Guo et al.
QKD systems according to their source encoding dimensions: discrete-variable QKD (DVQKD) and continuous-variable (CV) QKD (CVQKD). DVQKD encodes information on finite dimensions of Hilbert space, e.g. encodes polarization and phase of each of photons. CVQKD encodes information on infinite dimensions of Hilbert space, such as position and momentum quadrature of coherent states by a Gaussian modulation. In comparison with DVQKD, CVQKD systems have such advantages: (1) Modulation and decoding of CVs does not require specialized devices and can be implemented efficiently by standard telecommunication networks and devices that are currently available and in widespread use. However, the polarization of single photons in a DVQKD system cannot be encoded and decoded efficiently because of the technological limitations of current physical devices. As a convenient consequence
Data Loading...
