Strong direct product theorems for quantum communication and query complexity

SIAM Journal on Computing

Volumn 41, Issue 5, 2012, Pages 1122-1165

  Sherstov, Alexander A ^a  

^a Engineering IV   (United States)

Author keywords

Quantum communication complexity; Quantum query complexity; Strong direct product theorems; XOR lemmas

Indexed keywords

DIRECT PRODUCT THEOREMS; LOWER BOUNDS; POLYNOMIAL METHODS; QUANTUM COMMUNICATION COMPLEXITY; QUANTUM QUERY COMPLEXITY; QUERY COMPLEXITY; XOR LEMMAS;

COMPUTATION THEORY;

QUANTUM COMMUNICATION;

EID: 84868228327     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/110842661     Document Type: Conference Paper

References (60)

1. S. Aaronson, Limitations of quantum advice and one-way communication, Theory of Computing, 1 (2005), pp. 1-28.
2. S. Aaronson and Y. Shi, Quantum lower bounds for the collision and the element distinctness problems, J. ACM, 51 (2004), pp. 595-605.
3. N. Alon, Problems and results in extremal combinatorics, Part I, Discrete Math., 273 (2003), pp. 31-53.
4. A. Ambainis, Quantum lower bounds by quantum arguments, J. Comput. System Sci., 64 (2002), pp. 750-767.
5. A. Ambainis, R. Špalek, and R. de Wolf, A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs, Algorithmica, 55 (2009), pp. 422-461.
6. M. Anthony, Classification by polynomial surfaces, Discrete Appl. Math., 61 (1995), pp. 91- 103.
7. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, An information statistics approach to data stream and communication complexity, J. Comput. System Sci., 68 (2004), pp. 702-732.
8. B. Barak, M. Braverman, X. Chen, and A. Rao, How to compress interactive communication, in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), 2010, pp. 67-76.
9. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, Quantum lower bounds by polynomials, J. ACM, 48 (2001), pp. 778-797.
10. P. Beame, T. Pitassi, N. Segerlind, and A. Wigderson, A strong direct product theorem for corruption and the multiparty communication complexity of disjointness, Comput. Complexity, 15 (2006), pp. 391-432.
11. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs, and nonapproximability: Towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
12. A. Ben-Aroya, O. Regev, and R. de Wolf, A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs, in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2008, pp. 477-486.
13. H. Buhrman, R. Cleve, R. de Wolf, and C. Zalka, Bounds for small-error and zero-error quantum algorithms, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp. 358-368.
14. H. Buhrman, I. Newman, H. Röhrig, and R. de Wolf, Robust polynomials and quantum algorithms, Theory Comput. Syst., 40 (2007), pp. 379-395.
15. H. Buhrman and R. de Wolf, Communication complexity lower bounds by polynomials, in Proceedings of the 16th Annual IEEE Conference on Computational Complexity (CCC), 2001, pp. 120-130.
16. A. Chakrabarti, Y. Shi, A. Wirth, and A. C.-C. Yao, Informational complexity and the direct sum problem for simultaneous message complexity, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 270-278.
17. R. Cleve, W. Slofstra, F. Unger, and S. Upadhyay, Perfect parallel repetition theorem for quantum XOR proof systems, Comput. Complexity, 17 (2008), pp. 282-299.
18. A. Drucker, Improved direct product theorems for randomized query complexity, in Proceedings of the 26th Annual IEEE Conference on Computational Complexity (CCC), 2010, pp. 1-11.
19. A. Eremenko and P. Yuditskii, Uniform approximation of sgn(x) by polynomials and entire functions, J. Anal. Math., 101 (2007), pp. 313-324.
20. T. Feder, E. Kushilevitz, M. Naor, and N. Nisan, Amortized communication complexity, SIAM J. Comput., 24 (1995), pp. 736-750.
21. J. Håstad, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
22. R. Jain, New strong direct product results in communication complexity, in Electronic Colloquium on Computational Complexity (ECCC), 2011, Report TR11-024.
23. R. Jain and H. Klauck, New results in the simultaneous message passing model via information theoretic techniques, in Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC), 2009, pp. 369-378.
24. R. Jain, H. Klauck, and A. Nayak, Direct product theorems for classical communication complexity via subdistribution bounds, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), 2008, pp. 599-608.
25. R. Jain, A. Pereszlényi, and P. Yao, A Direct Product Theorem for Bounded-Round Public- Coin Randomized Communication Complexity, http://arxiv.org/abs/1201.1666 (2012).
26. R. Jain, J. Radhakrishnan, and P. Sen, A direct sum theorem in communication complexity via message compression, in Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP), 2003, pp. 300-315.
27. R. Jain, J. Radhakrishnan, and P. Sen, Prior entanglement, message compression and privacy in quantum communication, in Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC), 2005, pp. 285-296.
28. S. Jukna, Extremal Combinatorics with Applications in Computer Science, Springer-Verlag, Berlin, 2001.
29. J. Kahn, N. Linial, and A. Samorodnitsky, Inclusion-exclusion: Exact and approximate, Combinatorica, 16 (1996), pp. 465-477.
30. M. Karchmer, R. Raz, and A. Wigderson, Super-logarithmic depth lower bounds via the direct sum in communication complexity, Comput. Complexity, 5 (1995), pp. 191-204.
31. H. Klauck, Quantum and classical communication-space tradeoffs from rectangle bounds, in Proceedings of the 24th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2004, pp. 384-395.
32. H. Klauck, Lower bounds for quantum communication complexity, SIAM J. Comput., 37 (2007), pp. 20-46.
33. H. Klauck, A strong direct product theorem for disjointness, in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), 2010, pp. 77-86.
34. H. Klauck, R. Špalek, and R. de Wolf, Quantum and classical strong direct product theorems and optimal time-space tradeoffs, SIAM J. Comput., 36 (2007), pp. 1472-1493.
35. A. R. Klivans and A. A. Sherstov, Lower bounds for agnostic learning via approximate rank, Comput. Complexity, 19 (2010), pp. 581-604.
36. I. Kremer, Quantum Communication, M.S. thesis, Computer Science Department, Hebrew University, 1995.
37. E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, New York, 1997.
38. T. Lee and J. Roland, A strong direct product theorem for quantum query complexity, in Proceedings of the 27th Annual IEEE Conference on Computational Complexity (CCC), 2012.
39. T. Lee and A. Shraibman, Lower bounds in communication complexity, Found. Trends Theoret. Comput. Sci., 3 (2009), pp. 263-398.
40. T. Lee, A. Shraibman, and R. Špalek, A direct product theorem for discrepancy, in Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (CCC), 2008, pp. 71-80.
41. N. Linial, S. Mendelson, G. Schechtman, and A. Shraibman, Complexity measures of sign matrices, Combinatorica, 27 (2007), pp. 439-463.
42. N. Linial and A. Shraibman, Lower bounds in communication complexity based on factorization norms, Random Structures Algorithms, 34 (2009), pp. 368-394.
43. N. Nisan, S. Rudich, and M. E. Saks, Products and help bits in decision trees, SIAM J. Comput., 28 (1999), pp. 1035-1050.
44. I. Parnafes, R. Raz, and A. Wigderson, Direct product results and the GCD problem, in old and new communication models, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), 1997, pp. 363-372.
45. R. Raz, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.
46. A. A. Razborov, Quantum communication complexity of symmetric predicates, Izv. Russian Academy of Sciences, Mathematics, 67 (2002), pp. 145-159.
47. T. J. Rivlin, An Introduction to the Approximation of Functions, Dover Publications, New York, 1981.
48. M. E. Saks, Slicing the hypercube, Surveys Combinatorics, (1993), pp. 211-255.
49. R. Shaltiel, Towards proving strong direct product theorems, Comput. Complexity, 12 (2003), pp. 1-22.
50. A. A. Sherstov, Communication lower bounds using dual polynomials, Bulletin Eur. Assoc. Theor. Comput. Sci. EATCS, 95 (2008), pp. 59-93.
51. A. A. Sherstov, Approximate inclusion-exclusion for arbitrary symmetric functions, Comput. Complexity, 18 (2009), pp. 219-247.
52. A. A. Sherstov, The pattern matrix method, SIAM J. Comput., 40 (2011), pp. 1969-2000.
53. A. A. Sherstov, The multiparty communication complexity of set disjointness, in Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), 2012, pp. 525-544.
54. Y. Shi and Y. Zhu, Quantum communication complexity of block-composed functions, Quantum Inf. Comput., 9 (2009), pp. 444-460.
55. R. Špalek, The multiplicative quantum adversary, in Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (CCC), 2008, pp. 237-248.
56. E. Viola and A. Wigderson, Norms, XOR lemmas, and lower bounds for polynomials and protocols, Theory of Computing, 4 (2008), pp. 137-168.
57. R. de Wolf, Quantum Computing and Communication Complexity, Ph.D. thesis, University of Amsterdam, 2001.
58. R. de Wolf, A note on quantum algorithms and the minimal degree of -error polynomials for symmetric functions, Quantum Inf. Comput., 8 (2008), pp. 943-950.
59. A. C.-C. Yao, Theory and applications of trapdoor functions, in Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1982, pp. 80-91.
60. A. C.-C. Yao, Quantum circuit complexity, in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.