On communication over an entanglement-assisted quantum channel

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 698-704

  Nayak, Ashwin ^a   Salzman, Julia ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Communication complexity; Entanglement assisted quantum channel; Quantum communication

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERRORS; LINEAR ALGEBRA; PROBABILITY; QUANTUM ELECTRONICS;

COMMUNICATION COMPLEXITY; ENTANGLEMENT ASSISTED QUANTUM CHANNEL; QUANTUM COMMUNICATION;

INFORMATION THEORY;

EID: 0036038684     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/510002.510007     Document Type: Conference Paper

References (20)

1. The quantum communication complexity of sampling
2. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
3. Quantum information theory
4. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
5. Quantum complexity theory
6. Quantum vs. classical communication and computation
7. Communication complexity lower bounds by polynomials
8. Quantum entanglement and the communication complexity of the inner product function
9. Some estimates of the information transmitted by quantum communication channels
10. On quantum and probabilistic communication: Las Vegas and one-way protocols
11. Lower bounds for quantum communication complexity
12. Interaction in quantum communication and the complexity of Set Disjointness
13. Optimal lower bounds for quantum automata and random access codes
14. Exponential separation of quantum and classical communication complexity
15. Communication complexity of quantum state transformations
16. Quantum circuit complexity