Phase-Matching Quantum Key Distribution
By Xiongfeng Ma, Pei Zeng, Hongyi Zhou. Physical Review X, 2018
296 citations recorded by the source corpus.
Quantum key distribution allows remote parties to generate information-theoretic secure keys. The bottleneck throttling its real-life applications lies in the limited communication distance and key generation speed, due to the fact that the information carrier can be easily lost in the channel. For all the current implementations, the key rate is bounded by the channel transmission probability, $\eta$. Rather surprisingly, by matching the phases of two coherent states and encoding the key information into the common phase, this linear key-rate constraint can be overcome---the secure key rate scales with the square root of the transmission probability, $O(\sqrt{\eta})$, as proposed in twin-field quantum key distribution [Nature (London) 557, 400 (2018)]. To achieve this, we develop an optical-mode-based security proof that is different from the conventional qubit-based security proofs. Furthermore, the proposed scheme is measurement device independent, i.e., it is immune to all possible detection attacks. The simulation result shows that the key rate can even exceed the transmission probability $\eta$ between two communication parties. In addition, we apply phase postcompensation to devise a practical version of the scheme without phase locking, which makes the proposed scheme feasible with the current technology. This means that quantum key distribution can enjoy both sides of the world---practicality and security.
Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/85670868b210bb28591ad775d815ef9f961c8566
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Atomic and Molecular Physics, and Optics
Citations in the corpus
- Twin-field quantum key distribution over 830-km fibre (2019, methodology): “where we ignore an amount of bit O(log2 1/ε) related to composable security [18], ε ≥ 0 is called a smoothing parameter and n is the number of bits in Alice’s raw key zA.”
- Advances in quantum cryptography (2019, unknown): “Example of noneffective repeaters are MDI-nodes simply based on Bell detections [176, 177, 182] while examples of effective repeaters are MDI-nodes exploiting phase-randomization, such as TF-QKD [183, 184] and the related protocols of PM-QKD [185], SNS-QKD [187–190], and NPPTFQKD [191–195].”
- End-to-end capacities of a quantum communication network (2019, background): “(62), (64), and (66) to the REE, we get the single-letter upper bounds”