2000/12/21 by Sibasish Ghosh, Guruprasad Kar, Ghosh, Sibasish +6
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.quant-ph/0012118
openalex publication_date 2000/12/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Very recently, it was shown by Ghosh, Kar, Roy and Sen (Entanglement vs. Noncommutativity in Teleportation, quant-ph/0010012) that if it is a priori known that the state to be teleported is from a commuting set of qubits, a separable channel is sufficient. We show that 1 ebit of entanglement is a necessary resource to teleport a qubit even when it is known to be one of two noncommuting states.