Abstract
Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on the communication channel preclude the direct long-distance transmission of quantum information in many relevant scenarios. In principle, quantum repeaters allow one to overcome losses. However, realistic hardware parameters make long-distance quantum communication a challenge in practice. For instance, in many protocols an entangled pair is generated that needs to wait in quantum memory until the generation of an additional pair. During this waiting time the first pair decoheres, impacting the quality of the final entanglement produced. At the cost of a lower rate, this effect can be mitigated by imposing a cutoff condition. For instance, a maximum storage time for entanglement after which it is discarded. In this article, we optimize the cutoffs for quantum repeater chains. First, we develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols which include a cutoff. Then, we use the algorithm to optimize cutoffs in order to maximize the secret-key rate between the end nodes of the repeater chain. In this article, we find that the use of the optimal cutoff extends the parameter regime for which secret key can be generated and, moreover, significantly increases the secret-key rate for a large range of parameters.
Highlights
The realization of a quantum internet [1] will allow any two parties on earth to implement tasks that are impossible with its classical counterpart [2]
Quantum communication schemes rely on the distribution of entanglement between spatially separated parties, which in practice is precluded over long distances due to loss in the communication channel
This problem can be overcome by dividing the distance between the sender and receiver of the quantum information into smaller segments, which are connected by intermediate nodes called quantum repeaters [3]
Summary
The realization of a quantum internet [1] will allow any two parties on earth to implement tasks that are impossible with its classical counterpart [2]. For a given composite protocol (including the cut-off condition τ or wcut for each CUT-OFF block), the simulation of the entanglement distribution process is determined by 4 hardware parameters: the success probability of elementary link generation pgen, the swap success probability pswap, the Werner parameter of the elementary link w0 and the memory coherence time tcoh.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
