Quantum communication and complexity

Theoretical Computer Science

Volumn 287, Issue 1, 2002, Pages 337-353

  De Wolf, Ronald ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Communication complexity; Quantum computing

Indexed keywords

FUNCTIONS; INFORMATION THEORY; NETWORK PROTOCOLS; QUANTUM THEORY;

QUANTUM COMPUTING;

COMPUTATIONAL COMPLEXITY;

EID: 0037174206     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00377-8     Document Type: Article

References (66)

1. Communication complexity in a 3-computer model
2. Quantum dense coding and a lower bound for 1-way quantum finite automata
3. The quantum communication complexity of sampling
4. Complexity classes in communication complexity theory
5. Randomized simultaneous messages: Solution of a problem of Yao in communication complexity
6. Elementary gates for quantum computation
7. Quantum lower bounds by polynomials
8. On the Einstein-Podolsky-Rosen paradox
9. Strengths and weaknesses of quantum computing
10. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
11. Quantum information theory
12. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
13. Quantum complexity theory
14. Tight bounds on quantum searching
15. The cost of exactly simulating quantum entanglement with classical communication
16. Quantum computing and communication complexity
17. Quantum entanglement and communication complexity
18. Quantum fingerprinting
19. Quantum vs. classical communication and computation
20. Bounds for small-error and zero-error quantum algorithms
21. Multiparty quantum communication complexity
22. Communication complexity lower bounds by polynomials
23. Substituting quantum entanglement for communication
24. Quantum algorithms revisited
25. Quantum entanglement and the communication complexity of the inner product function
26. Quantum theory, the Church-Turing principle, and the universal quantum Turing machine
27. Quantum computational networks
28. Rapid solution of problems by quantum computation
29. Can quantum-mechanical description of physical reality be considered complete?
30. A limit on the speed of quantum computation in determining parity
31. Forbidden intersections
32. On quantum versions of the Yao principle
33. A fast quantum mechanical algorithm for database search
34. Bounds for the quantity of information transmitted by a quantum communication channel
35. Improved quantum communication complexity bounds for disjointness and equality
36. The probabilistic communication complexity of set intersection
37. On quantum and probabilistic communication: Las Vegas and one-way protocols
38. Quantum communication complexity
39. Lower bounds for quantum communication complexity
40. Interaction in quantum communication and the complexity of set disjointness
41. Classical simulation of quantum entanglement without local hidden variables
42. Las Vegas is better than determinism in VLSI and distributed computing
43. Optimal lower bounds for quantum automata and random access codes
44. On communication over an entanglement-assisted quantum channel
45. Private vs. common random bits in communication complexity
46. Public vs. private coin flips in one round communication games
47. Fourier analysis for probabilistic communication complexity
48. Exponential separation of quantum and classical communication complexity
49. On the distributional complexity of disjointness
50. Lower bounds in the quantum cell probe model
51. Physicists triumph at Guess my Number
52. Classical versus quantum communication complexity
53. Characterization of non-deterministic quantum query and quantum communication complexity
54. A single quantum cannot be copied
55. Probabilistic computations: Toward a unified measure of complexity
56. Some complexity questions related to distributive computing
57. Quantum circuit complexity
58. Grover's quantum searching algorithm is optimal