Quantum multiparty communication complexity and circuit lower bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4484 LNCS, Issue , 2007, Pages 306-317

  Kerenidis, Iordanis ^a,b  

^a CNRS   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBLEM SOLVING; QUANTUM THEORY;

COMMUNICATION COMPLEXITY; QUANTUM MODEL; SYMMETRIC CIRCUITS;

COMPUTATIONAL COMPLEXITY;

EID: 35448948233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72504-6_28     Document Type: Conference Paper

References (18)

1. S Aaronson, Quantum Computing, Postselection, and Probabilistic PolynomialTime In Proceedings of the Royal Society A, 461 (2063):3473-3482, 2005.
2. D Aharonov, O Regev, Lattice problems in NP ∩ coNP In Proc. 45th IEEE FOCS, 2004.
3. L Babai, N Nisan, M Szegedy, Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs Journal of Computer and System Sciences, Volume 45 , Issue 2:204-232, 1992.
4. R Beigel, J Tarui, On ACC, Computational Complexity, 1994.
5. Z Bar-Yossef, TS Jayram, I Kerenidis, Exponential Separation of Quantum and Classical One-Way Communication Complexity Proceedings of 36th ACM STOC, 2004.
6. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting, Physical Review Letters, 87(16), 2001.
7. AK Chandra, ML Furst, RJ Lipton, Multi-party protocols In Proceedings of the 15th annual ACM STOC,1983.
8. F Chung Quasi-random classes of hypergraphs Random Structures and Algorithms, 1990.
9. V Grolmusz The BNS Lower Bound for Multi-Party Protocols is Nearly Optimal Information and Computation, 1994.
10. J Hastad, M Goldmann, On the power of small-depth threshold circuits Computational Complexity 1:113-129, 1991.
11. I. Kerenidis, R. de Wolf, Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument In Proceedings of the 15th annual ACM STOC,2003.
12. E. Kushilevitz, N. Nisan, Communication complexity Cambridge University Press, 1997.
13. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 2000.
14. R.Raz, The BNS-Chung Criterion for multi-party communication complexity Journal of Computational Complexity 9(2) (2000), pp. 113-122.
15. R Raz Exponential separation of quantum and classical communication complexity In Proceedings of 31st ACM STOC, 1999.
16. S. Wehner, R. de Wolf, Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval 32nd ICALP 2005), LNCS 3580, 1424-1436.
17. R. de Wolf Lower Bounds on Matrix Rigidity via a Quantum Argument. In 33rd International Colloquium on Automata, Languages and Programming (ICALP'06), LNCS 4051, pp.62-71.
18. AC Yao, On ACC and threshold circuits Proc. 31st Ann. IEEE FOCS, 1990.