A SUFFICIENT AND NECESSARY CONDITION FOR SUPERDENSE CODING OF QUANTUM STATES

DOI10.1142/S0219749908004298zbMath1156.81355arXivquant-ph/0612149OpenAlexW2055057751WikidataQ62049444 ScholiaQ62049444MaRDI QIDQ3604135

Dao Wen Qiu

Publication date: 24 February 2009

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0612149

zbMATH Keywords

communicationentanglementsuperdense coding

Mathematics Subject Classification ID

Quantum computation (81P68) Communication theory (94A05)

Related Items (1)

Probabilistic cloning of two single-atom states via thermal cavity

Cites Work

• Unnamed Item
• Aspects of generic entanglement
• All teleportation and dense coding schemes
• Remote Preparation of Quantum States
• Optimal Superdense Coding of Entangled States
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Quantum cryptography

This page was built for publication: A SUFFICIENT AND NECESSARY CONDITION FOR SUPERDENSE CODING OF QUANTUM STATES