Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Foundations
Capacity-approaching quantum repeaters for quantum communications
arXiv
Authors: Masoud Ghalaii, Stefano Pirandola
Year
2020
Paper ID
22246
Status
Preprint
Abstract Read
~2 min
Abstract Words
183
Citations
N/A
Abstract
In present-day quantum communications, one of the main problems is the lack of a quantum repeater design that can simultaneously secure high rates and long distances. Recent literature has established the end-to-end capacities that are achievable by the most general protocols for quantum and private communication within a quantum network, encompassing the case of a quantum repeater chain. However, whether or not a physical design exists to approach such capacities remains a challenging objective. Driven by this motivation, in this work, we put forward a design for continuous-variable quantum repeaters and show that it can actually achieve the feat. We also show that even in a noisy regime our rates surpass the Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound. Our repeater setup is developed upon using noiseless linear amplifiers, quantum memories, and continuous-variable Bell measurements. We, furthermore, propose a non-ideal model for continuous-variable quantum memories that we make use of in our design. We then show that potential quantum communications rates would deviate from the theoretical capacities, as one would expect, if the quantum link is too noisy and/or low-quality quantum memories and amplifiers are employed.
Why This Paper Matters
- This paper contributes to the Quantum Foundations research area in the Quantum Articles archive.
- It adds a 2020 reference point for readers tracking recent quantum research.
- In present-day quantum communications, one of the main problems is the lack of a quantum repeater design that can simultaneously secure high rates and long distances.
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.