Entanglement-distribution maximization over one-sided Gaussian noisy channels

2010/01/31 by Xiang-Bin Wang, Xiang‐Bin Wang, Zong-Wen Yu +3 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Channel (broadcasting) #Computer science #Gaussian #Mathematical analysis #Mathematical optimization #Mathematics #Maximization #Mode (computer interface) #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Squashed entanglement #Statistical physics #Telecommunications #Upper and lower bounds #quant-ph

paper · pdf · doi:10.1103/physreva.82.022316

published in Physical Review A 82(2) (American Physical Society)

arxiv created 2010/06/11 · openalex publication_date 2010/08/12 · arxiv updated 2015/05/14 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

We present an upper bound of the entanglement evolution for two-mode Gaussian pure states under a one-sided Gaussian map. Based on this, the optimization of entanglement evolution is studied. Even if complete information about the one-sided Gaussian noisy channel does not exist, one can still maximize the entanglement distribution by testing the channel with only two specific states.

Citations

• Evolution equation of entanglement for bipartite systems
• Evolution equation for quantum entanglement
• Quantum information with Gaussian states
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Fidelity and information in the quantum teleportation of continuous variables
• Teleportation of quantum states
• Bound Entangled Gaussian States
• Unconditional Quantum Teleportation
• Inseparability Criterion for Continuous Variable Systems
• Sudden Death of Entanglement
• Teleportation of Continuous Quantum Variables
• Peres-Horodecki Separability Criterion for Continuous Variable Systems
• Quantifying Entanglement