Deterministic Entanglement Distribution on Series-Parallel Quantum Networks

Abstract

The performance of distributing entanglement between two distant nodes in a large-scale quantum network (QN) of partially entangled bipartite pure states is generally benchmarked against the classical entanglement percolation (CEP) scheme. Improvements beyond CEP were only achieved by nonscalable strategies for restricted QN topologies. This paper explores and amplifies a new and more effective mapping of a QN, referred to as concurrence percolation theory (ConPT), that suggests using deterministic rather than probabilistic protocols for scalably improving on CEP across arbitrary QN topologies. More precisely, we implement ConPT via a deterministic entanglement transmission (DET) scheme that is fully analogous to resistor network analysis, with the corresponding series and parallel rules represented by deterministic entanglement swapping and concentration protocols, respectively. The main contribution of this paper is to establish a powerful mathematical framework, which is applicable to arbitrary d-dimensional information carriers (qudits), that provides different natural optimality metrics in terms of generalized k-concurrences (a family of fundamental entanglement measures) for different QN topology. In particular, we conclude that the introduced DET scheme (a) is optimal over the well-known nested repeater protocol for distilling entanglement from partially entangled qubits and (b) leads to higher success probabilities of obtaining a maximally entangled state than using CEP. The implementation of the DET scheme is experimentally feasible as tested on IBM's quantum computation platform.

arXiv comment18 pages, 6 figures. Final version

References in corpus (34)

• Statistical mechanics of complex networks
• The Quantum Internet
• Concentrating Partial Entanglement by Local Operations
• Entanglement of a Pair of Quantum Bits
• Resilience of the Internet to random breakdowns
• Quantum state transfer and entanglement distribution among distant nodes in a quantum network
• Quantum Resource Theories
• Conditions for a class of entanglement transformations
• Entanglement monotones
• Realization of a multi-node quantum network of remote solid-state qubits
• Deterministic delivery of remote entanglement on a quantum network
• Generalized Schmidt decomposition and classification of three-quantum-bit states
• Entanglement of pure states for a single copy
• Entanglement Distillation between Solid-State Quantum Network Nodes
• Purification via entanglement swapping and conserved entanglement
• Entanglement-assisted local manipulation of pure quantum states
• End-to-end capacities of a quantum communication network
• Quantum Information Scrambling in a Superconducting Qutrit Processor
• Entanglement Percolation in Quantum Networks
• Beating the channel capacity limit for superdense coding with entangled ququarts
• Demonstration of a High-Fidelity CNOT for Fixed-Frequency Transmons with Engineered ZZ Suppression
• Family of Concurrence Monotones and its Applications
• Complex Networks from Classical to Quantum
• Deterministic generation of all-photonic quantum repeaters from solid-state emitters
• Entanglement Distribution in Pure-State Quantum Networks
• Entanglement percolation in quantum complex networks
• Distribution of entanglement in large-scale quantum networks
• Deterministic entanglement concentration
• Concurrence Percolation in Quantum Networks
• Multipartite entanglement percolation
• Bandwidth-tunable single photon source in an ion trap quantum network
• Fast high-fidelity entangling gates for spin qubits in Si double quantum dots
• Quantum tomography benchmarking
• Quantum Entanglement Percolation

Cited by in corpus (5)

• Complex Quantum Networks: a Topical Review
• Quantum Communication Networks Enhanced by Distributed Quantum Memories
• Percolation thresholds and connectivity in quantum networks
• Entanglement percolation in random quantum networks
• Reducing Complexity of Shadow Process Tomography with Generalized Measurements