Optimal Rate for Constant―Fidelity Entanglement in Quantum Communication Networks.docVIP

Optimal Rate for Constant―Fidelity Entanglement in Quantum Communication Networks 　　In this paper， we propose an entanglement scheme for long-distance， constant-fidelity communication in quantum networks. We discuss the optimal rate of entanglement that allows for constant fidelity in both elementary and multihop links. We also discuss time complexity and propose the mathematical order of the rate capacity for an entanglement scheme. We propose a recursive entanglement scheme， a simultaneous entanglement scheme， and an adjacent entanglement scheme mathematically analyze these schemes. The rate capacity of the recursive and simultaneous entanglement schemes is Ω（1/en ）， but the adjacent entanglement scheme performs better， providing a rate of Ω（1/n）. 　　rate capacity； constant fidelity； entanglement scheme； ad hoc quantum networks 　　1 Introduction 　　Quantum processing and communication networks combine the disciplines of quantum mechanics and classical information science. However， quantum networks are more secure and efficient than classical networks [1]-[3]. Quantum communication networks are based on quantum teleportation， which is essential for transmitting quantum states and establishing quantum channels between nodes at a distance [2]. Quantum teleportation exploits one of the most intriguing properties of quantum mechanics： entanglement. In quantum entanglement， Einstein， Podolsky， Rosen （EPR） pairs are generated and then distributed via fibers or optical free-space links. This allows different nodes to transport a quantum state by transmitting classical bits rather than quantum bits [2]. 　　At present， photons are primarily used as the carrier in quantum entanglement generation. They are used over distances of some hundreds of kilometers （e.g 250 km on fiber links and 144 km on free space） [3]. However， the success of entanglement decreases exponentially with distance because of absorption loss and detector noise in the transmission channel. 　　A solut