Exponential lower bound for 2-query locally decodable codes via a quantum argument

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 106-115

  Kerenidis, Iordanis ^a   De Wolf, Ronald ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CWI   (Netherlands)

Author keywords

Locally decodable codes; Private information retrieval; Quantum computing

Indexed keywords

ALGORITHMS; DECODING; INFORMATION ANALYSIS; SERVERS;

ERROR CONTROL CODES;

QUANTUM THEORY;

EID: 0038107747     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780560     Document Type: Conference Paper

References (27)

1. A. Ambainis. Upper bound on communication complexity of private information retrieval. In Proceedings of the 24th ICALP, volume 1256 of Lecture Notes in Computer Science, pages 401-407, 1997.
2. L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proceedings of 23rd ACM STOC, pages 21-31, 1991.
3. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulators unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307-318, 1993
4. D. Beaver and J. Feigenbaum. Hiding instances in multi-oracle queries. In 7th Annual Symposium on Theoretical Aspects of Computer Science, vol. 415, February 1990.
5. R. Beigel, L. Fortnow, and W. Gasarch. Nearly tight bounds for private information retrieval systems. Technical Note 2002-L001N, NEC Laboratories America, 2002.
6. 1/(2k-1)) barrier for information-theoretic Private Information Retrieval. In Proceedings of 43rd IEEE FOCS, pages 261-270, 2002.
7. H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh. Are bitvectors optimal? In Proceedings of 32nd ACM STOC, pages 449-458, 2000.
8. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. Journal of the ACM, 45(6):965-981, 1998. Earlier version in FOCS'95.
9. R. Cleve, W. van Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In Proceedings of 1st NASA QCQC conference, volume 1509 of Lecture Notes in Computer Science, pages 61-74, 1998. quant-ph/9708019.
10. W. van Dam. Quantum oracle interrogation: Getting all information for almost half the price. In Proceedings of 39th IEEE FOCS, pages 362-367, 1998.
11. A. Deshpande, R. Jain, T. Kavitha, S. Lokam, and J. Radhakrishnan. Better lower bounds for locally decodable codes. In Proceedings of 17th IEEE Conference on Computational Complexity, pages 184-193, 2002.
12. J. Feigenbaum and L. Fortnow. Random reducibility of complete sets. SIAM Journal on Computing, 22(5):994-1005, October 1993.
13. P. Gemmel, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approximating functions. In Proceedings of 23rd ACM STOC, pages 32-42, 1991.
14. P. Gemmel and M. Sudan. Highly resilient correctors for polynomials. Information Processing Letters, 43(4):169-174, 1992
15. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan. Lower bounds for linear locally decodable codes and private information retrieval. In Proceedings of 17th IEEE Conference on Computational Complexity, pages 175-183, 2002. Also on ECCC.
16. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proceedings of 32nd ACM STOC, pages 80-86, 2000.
17. H. Klauck, A. Nayak, A. Ta-Shma, and D. Zuckerman. Interaction in quantum communication and the complexity of set disjointness. In Proceedings of 33rd ACM STOC, pages 124-133, 2001.
18. R. Lipton. New directions in testing. In Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, 1989.
19. C. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: Optimal Up to Constant Factors. In Proceedings of 35th ACM STOC, 2003. Preliminary version.
20. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of 40th IEEE FOCS, pages 369-376, 1999. quant-ph/9904093.
21. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
22. K. Obata. Optimal lower bounds for 2-query locally decodable linear codes. In Proceedings of 6th RANDOM, volume 2483 of Lecture Notes in Computer Science, pages 39-50, 2002.
23. A. Polishchuk and D. A. Spielman. Nearly-linear size holographic proofs. In Proceedings of 26th ACM STOC, pages 194-203, 1994.
24. J. Radhakrishnan, P. Sen, and S. Venkatesh. The quantum complexity of set membership. In Proceedings of 41st IEEE FOCS, pages 554-562, 2000. quant-ph/0007021.
25. P. Sen and S. Venkatesh. Lower bounds in the quantum cell probe model. In Proceedings of 28th ICALP, volume 2076 of Lecture Notes in Computer Science, pages 358-369. Springer, 2001. More extensive version at quant-ph/0104100.
26. M. Sipser and D. A. Spielman. Expander codes. IEEE Transactions on Information Theory, 42:1710-1722, 1996. Earlier version in FOCS'94.
27. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. In Proceedings of the 31st ACM STOC, pages 537-546, 1999