2006/11/23 by Vahid Karimipour, V. Karimipour, Laleh Memarzadeh +1 · 17 citations
Computer Science · Physics and Astronomy · #Cluster state #Computer science #Encoding (memory) #Mutual information #Peres–Horodecki criterion #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum discord #Quantum entanglement #Quantum information #Quantum mechanics #Quantum nonlocality #Qubit #Separable state #Statistical physics #String (physics) #quant-ph
paper · pdf · doi:10.1103/physreva.74.062311
published in Physical Review A 74(6) (American Physical Society) · 14 pages, 8 figures, latex, accepted for publication in Physical Review A
arxiv created 2006/11/23 · openalex publication_date 2006/12/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We investigate the problem of enhancement of mutual information by encoding classical data into entangled input states of arbitrary length and show that while there is a threshold memory or correlation parameter beyond which entangled states outperform the separable states, resulting in a higher mutual information, this memory threshold increases toward unity as the length of the string increases. These observations imply that encoding classical data into entangled states may not enhance the classical capacity of quantum channels.