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

Journal of Computer and System Sciences

Volumn 69, Issue 3 SPEC. ISS., 2004, Pages 395-420

  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

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); ERROR CORRECTION; INFORMATION RETRIEVAL; PROBABILITY;

LOCALLY DECODABLE CODES; PRIVATE INFORMATION RETRIEVAL; QUANTUM COMPUTING; QUANTUM QUERY;

QUANTUM THEORY;

EID: 4544225791     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.04.007     Document Type: Conference Paper

References (35)

1. A. Ambainis, Upper bound on communication complexity of private information retrieval, in: Proceedings of the 24th ICALP, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 401-407.
2. L. Babai, L. Fortnow, L. Levin, M. Szegedy, Checking computations in polylogarithmic time, in: Proceedings of 23rd ACM STOC, 1991, pp. 21-31.
3. Babai L., Fortnow L., Nisan N., Wigderson A. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comput. Complexity. 3(4):1993;307-318.
4. Beals R., Buhrman H., Cleve R., Mosca M., de Wolf R. Quantum lower bounds by polynomials. J. ACM. 48(4):2001;778-797. earlier version in FOCS'98 (quant-ph/9802049).
5. D. Beaver, J. Feigenbaum, Hiding instances in multioracle queries, in: Proceedings of the Seventh Annual Symposium on Theoretical Aspects of Computer Science (STACS'90), Lecture Notes in Computer Science, Vol. 415, Springer, Berlin, 1990, pp. 37-48.
6. R. Beigel, The polynomial method in circuit complexity, in: Proceedings of the Eighth IEEE Structure in Complexity Theory Conference, 1993, pp. 82-95.
7. R. Beigel, L. Fortnow, W. Gasarch, Nearly tight bounds for private information retrieval systems, Technical Report 2002-L001N, NEC Laboratories, America, October 2002.
8. 1/(2k-1)) barrier for information-theoretic private information retrieval, in: Proceedings of 43rd IEEE FOCS, 2002, pp. 261-270.
9. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, S. Vadhan, Robust PCPs of proximity, shorter PCPs and applications to coding, in: Proceedings of 36th ACM STOC, 2004, to appear.
10. H. Buhrman, P.B. Miltersen, J. Radhakrishnan, S. Venkatesh, Are bitvectors optimal?, in: Proceedings of 32nd ACM STOC, 2000, pp. 449-458.
11. Chor B., Goldreich O., Kushilevitz E., Sudan M. Private information retrieval. J. ACM. 45(6):1998;965-981. earlier version in FOCS'95.
12. R. Cleve, W. van Dam, M. Nielsen, A. Tapp, Quantum entanglement and the communication complexity of the inner product function, in: Proceedings of First NASA QCQC Conference, Lecture Notes in Computer Science, Vol. 1509, Springer, Berlin, 1998, pp. 61-74 (quant-ph/9708019).
13. W. van Dam, Quantum oracle interrogation: getting all information for almost half the price, in: Proceedings of 39th IEEE FOCS, 1998, pp. 362-367 (quant-ph/9805006).
14. A. Deshpande, R. Jain, T. Kavitha, S. Lokam, J. Radhakrishnan, Better lower bounds for locally decodable codes, in: Proceedings of 17th IEEE Conference on Computational Complexity, 2002, pp. 184-193.
15. Farhi E., Goldstone J., Gutmann S., Sipser M. A limit on the speed of quantum computation in determining parity. Phys. Rev. Lett. 81:1998;5442-5444. (quant-ph/9802045).
16. Feigenbaum J., Fortnow L. Random-self-reducibility of complete sets. SIAM J. Comput. 22(5):1993;994-1005. earlier version in Structures'91.
17. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, A. Wigderson, Self-testing/correcting for polynomials and for approximate functions, in: Proceedings of 23rd ACM STOC, 1991, pp. 32-42.
18. Gemmell P., Sudan M. Highly resilient correctors for polynomials. Inform. Process. Lett. 43(4):1992;169-174.
19. Gisin N., Renner R., Wolf S. Linking classical and quantum key agreement. is there a classical analog to bound entanglement? Algorithmica. 34(4):2002;389-412. earlier version in Crypto'2000.
20. O. Goldreich, H. Karloff, L. Schulman, L. Trevisan, Lower bounds for linear locally decodable codes and private information retrieval, in: Proceedings of 17th IEEE Conference on Computational Complexity, 2002, pp. 175-183; also on ECCC.
21. J. Katz, L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, in: Proceedings of 32nd ACM STOC, 2000, pp. 80-86.
22. I. Kerenidis, R. de Wolf, Exponential lower bound for 2-query locally decodable codes via a quantum argument, in: Proceedings of 35th ACM STOC, 2003, pp. 106-115 (quant-ph/0208062).
23. H. Klauck, A. Nayak, A. Ta-Shma, D. Zuckerman, Interaction in quantum communication and the complexity of set disjointness, in: Proceedings of 33rd ACM STOC, 2001, pp. 124-133.
24. R. Lipton, New directions in testing, in: J. Feigenbaum, M. Merritt (Eds.), Distributed Computing and Cryptography, Series in Discrete Mathematics and Theoretical Computer Science, Vol. 2, ACM/American Mathematical Society, New York/Providence, RI, 1991, pp. 191-202.
25. C. Lu, O. Reingold, S. Vadhan, A. Wigderson, Extractors: optimal up to constant factors, in: Proceedings of 35th ACM STOC, 2003, pp. 602-611.
26. E. Mann, Private access to distributed information, Master's Thesis, Technion - Israel Institute of Technology, Haifa, 1998.
27. A. Nayak, Optimal lower bounds for quantum automata and random access codes, in: Proceedings of 40th IEEE FOCS, 1999, pp. 369-376 (quant-ph/9904093).
28. Nielsen M.A., Chuang I.L. Quantum Computation and Quantum Information. 2000;Cambridge University Press, Cambridge, MA.
29. K. Obata, Optimal lower bounds for 2-query locally decodable linear codes, in: Proceedings of Sixth RANDOM, Lecture Notes in Computer Science, Vol. 2483, Springer, Berlin, 2002, pp. 39-50.
30. J. Radhakrishnan, P. Sen, S. Venkatesh, The quantum complexity of set membership, in: Proceedings of 41st IEEE FOCS, 2000, pp. 554-562 (quant-ph/0007021).
31. R. Renner, S. Wolf, New bounds in secret-key agreement: the gap between formation and secrecy extraction, in: Proceedings of Eurocrypt'03, Lecture Notes in Computer Science, Vol. 2656, Springer, Berlin, 2003, pp. 562-577.
32. P. Sen, S. Venkatesh, Lower bounds in the quantum cell probe model, in: Proceedings of 28th ICALP, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 358-369; more extensive version at quant-ph/0104100.
33. Sipser M., Spielman D.A. Expander codes. IEEE Trans. Inform. Theory. 42:1996;1710-1722. earlier version in FOCS'94.
34. M. Sudan, L. Trevisan, S. Vadhan, Pseudorandom generators without the XOR lemma, in: Proceedings of 31st ACM STOC, 1999, pp. 537-546.
35. L. Trevisan, Personal communication, September 2002.