Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
Symmetry-protected privacy: beating the rate-distance linear bound over a noisy channel
arXiv
Authors: Pei Zeng, Weijie Wu, Xiongfeng Ma
Year
2019
Paper ID
7246
Status
Preprint
Abstract Read
~2 min
Abstract Words
209
Citations
N/A
Abstract
There are two main factors limiting the performance of quantum key distribution --- channel transmission loss and noise. Previously, a linear bound was believed to put an upper limit on the rate-transmittance performance. Remarkably, the recently proposed twin-field and phase-matching quantum key distribution schemes have been proven to overcome the linear bound. In practice, due to the intractable phase fluctuation of optical signals in transmission, these schemes suffer from large error rates, which renders the experimental realization extremely challenging. Here, we close this gap by proving the security based on a different principle --- encoding symmetry. With the symmetry-based security proof, we can decouple the privacy from the channel disturbance, and eventually remove the limitation of secure key distribution on bit error rates. That is, the phase-matching scheme can yield positive key rates even with high bit error rates up to 50%. In simulation, with typical experimental parameters, the key rate is able to break the linear bound with an error rate of 13%. Meanwhile, we provide a finite-data size analysis for the scheme, which can break the bound with a reasonable data size of 1012. Encouraged by high loss- and error-tolerance, we expect the approach based on symmetry-protected privacy will provide a new insight to the security of quantum key distribution.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2019 reference point for readers tracking recent quantum research.
- There are two main factors limiting the performance of quantum key distribution --- channel transmission loss and noise.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.