On quantum and probabilistic communication: Las Vegas and one-way protocols

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 644-651

  Klauck, Hartmut ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED ERRORS; COMMUNICATION COMPLEXITY; DETERMINISTIC COMMUNICATIONS; LOWER BOUNDS; PROBABILISTIC PROTOCOLS; QUANTUM FINITE AUTOMATA; QUANTUM PROTOCOLS; VC-DIMENSION;

BOOLEAN FUNCTIONS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; PROBABILITY;

QUANTUM COMMUNICATION; NETWORK PROTOCOLS;

QUANTUM LAS VEGAS PROTOCOLS;

EID: 0033726515     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335396     Document Type: Conference Paper

References (37)

1. D. Aharonov, A. Kitaev, N. Nisan. Quantum Circuits with Mixed States. Proc. 30th A CM Syrup. on Theory of Comp., pp.20-30,1998.
2. A.Ambainis, R.Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. Proc. 39th Symp. Found. of Computer Science, pp. 332-341, 1998.
3. A.Ambainis, A.Nayak, A.Ta-Shma, U.Vazirani. Dense quantum coding and a lower bound for 1-way quantum finite automata. Proc. 31th ACM Symp. on Theory of Comp., pp.376-383, 1999.
4. P.Beame, J.Lawry. Randomized versus Communication Nondeterministic Complexity. Proc. 24th ACM Symp. on Theory of Comp., pp.188-199, 1992.
5. C.H.Bennett, S.J.Wiesner. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett., vol.69, pp.2881-2884, 1992.
6. M.Boyer, G.Brassard, P.Hoyer, A.Tapp. Tight bounds on quantum searching. 4th Workshop on Physics and Computation, pp.36-43, 1996.
7. H.Buhrman, R.Cleve, A.Wigderson. Quantum vs. classical communication and comp. Proc. 30th ACM Symp. on Theory of Comp., pp.63-68,1998.
8. H.Buhrman, R.Cleve, R.de Wolf, C.Zalka. Reducing error probability in quantum algorithms. Proc. 40th Symp. Found. of Computer Science, 1999.
9. H.Buhrman, R.de Wolf. Communication Complexity Lower Bounds by Polynomials. quant-ph 991001.
10. N.Cerf, C.Adami. Quantum information theory of entanglement and measurement. Proc. of Physis and Computation PhysComp, pp.65-71, 1996.
11. R.Cleve, H.Buhrman. Substituting quantum entanglement for communication. Physical Review A, vol.56, pp.1201-1204, 1997.
12. R.Cleve, W.van Dam, M.Nielsen, A.Tapp. Quantum Entanglement and the Communication Complexity of the Inner Product Function. quant-ph 9708019.
13. P.Duris, Z.Galil, G.Schnitger. Lower Bounds on Communication Complexity. Information & Computation, vol.73, pp.1-22, 1987.
14. P.Duriš, J.Hromkovič, J.D.P.Rolim, G.Schnitger. Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. Symp. on Theoretical Aspects of Computer Science, pp.117-128, 1997.
15. L.K.Grover. A fast quantum mechanical algorithm for database search. 28th ACM Symposium on Theory of Computing, pp.212-219, 1996.
16. J.Gruszka. Quantum Computing. Wiley Interscience. 1999.
17. B.Halstenberg, R.Reischuk. Different Modes of Communication. SIAM Journal Comput., vol.22, pp.913-934, 1993.
18. A.S. Holevo. Some estimates on the information transmitted by quantum communication channels. Problems of Information Transmission, vol.9, pp.177-183, 1973.
19. J.Hromkovič. Communication Complexity and Parallel Computing. Springer, 1997.
20. J.Hromkovič, G.Schnitger. Nondeterministic Communication with a Limited Number of Advice Bits. Proc. 28th ACM Symp. on Theory of Comp., pp.451-560, 1996.
21. B.Kalyanasundaram, G.Schnitger. The Probabilistic Communication Complexity of Set Intersection. SIAM Journ.Discr.Math., vol.5, pp.545-557, 1992.
22. H.Klauck. On the Size of Probabilistic Formulae. 8th Int. Symp. on Algorithms and Computation, pp.243-252, 1997.
23. H.Klauck. Lower bounds for computation with limited Nondeterminism. 13th IEEE Conference on Computational Complexity, pp.141-153, 1998.
24. A.Kondacs, J.Watrous. On the power of quantum finite state automata. 38th Symp. Found. Computer Science, pp.66-75, 1997.
25. I. Kremer. Quantum Communication. Master's thesis (Hebrew University), 1995.
26. I. Kremer, N. Nisan, D. Ron. On Randomized One-Round Communication Complexity. 27th Symp. Theory of Comput., pp. 596-605, 1995
27. E.Kushilevitz, N.Nisan. Communication Complexity. Cambridge Univ. Press, 1996.
28. A.Nayak. Opt. lower bounds for quantum automata and random access codes. Proc. 40th Symp. Found. of Computer Science, 1999.
29. E.I. Nečiporuk. A Boolean function. Sov.Math.Dokl., vol.7, pp. 999-1000, 1966.
30. N.Nisan, A.Wigderson. Rounds in communication complexity revisited. SIAM Journ. Comput., vol.22, pp.211-219, 1993.
31. S.J.Ponzio, J.Radhakrishnan, S.Venkatesh. The communication complexity of pointer chasing: applications of entropy and sampling Proc. 31th ACM Symp. on Theory of Comp., pp. 602-611, 1999.
32. J. Preskill. Lecture notes on quantum information and quantum computation. Web address: www.theory.caltech.edu/people/preskill/ph229.
33. R. Raz. Exponential Separation of Quantum and Classical Communication Complexity. Proc. 31th ACM Symp. on Theory of Comp., pp. 358-367, 1999.
34. V.P. Roychowdhury, F. Vatan. An Almost-Quadratic Lower Bound for Quantum Formula Size. quant-ph 9903042, 1999.
35. P.W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal Comput., vol.26, pp.1484-1509, 1997. (Pubitemid 127613100)
36. A. Ta-Shma. Classical versus Quantum Communication Complexity. SIGACT News, vol.30(3), pp.25-34, 1999.
37. A.C. Yao. Quantum Circuit Complexity. 34th Symp. Found. of Computer Science, pp. 352-361, 1993.