Quantum Networks for Concentrating Entanglement

Abstract

If two parties, Alice and Bob, share some number, n, of partially entangled pairs of qubits, then it is possible for them to concentrate these pairs into some smaller number of maximally entangled states. We present a simplified version of the algorithm for such entanglement concentration, and we describe efficient networks for implementing these operations.

15 pages, 2 figures

Cited by in corpus (8)

• Quantum information with continuous variables
• A Survey on Quantum Channel Capacities
• Applications of coherent classical communication and the Schur transform to quantum information theory
• Efficient compression of quantum information
• Quantum Algorithmic Readout in Multi-Ion Clocks
• The Quantum Schur Transform: I. Efficient Qudit Circuits
• Testing symmetry on quantum computers
• Logarithmic-Depth Quantum Circuits for Hamming Weight Projections