A lattice problem in quantum NP

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 210-219

  Aharonov, D ^a   Regev, O ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Algorithm design and analysis; Autocorrelation; Computer science; Cryptography; Lattices; Polynomials; Quantum computing; Quantum mechanics; Upper bound

Indexed keywords

COMPUTER SCIENCE; CRYPTOGRAPHY; CRYSTAL LATTICES; FUNCTIONS; POLYNOMIALS; QUANTUM COMPUTERS; QUANTUM ENTANGLEMENT; QUANTUM THEORY;

ALGORITHM DESIGN AND ANALYSIS; AUTOCORRELATION FUNCTIONS; FURTHER DEVELOPMENT; LATTICE PROBLEMS; POSITIVE DEFINITE FUNCTION; QUANTUM COMPLEXITY; QUANTUM COMPUTING; UPPER BOUND;

AUTOCORRELATION;

EID: 84943399777     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238195     Document Type: Conference Paper

References (24)

1. D. Aharonov and T. Naveh. Quantum NP - a survey. In quant-ph/0210077, http://xxx.lanl.gov, 2002.
2. D. Aharonov and A. Ta-Shma. Quantum adiabatic state generation and stataistical zero knowledge. In Proc. 35th ACM Symp. on Theory of Computing, San Diego, CA, June 2003.
3. D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev. On the universality of quantum adiabatic computation on a 2D lattice (temporary name). 2003. Manuscript.
4. A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman. Exponential algorithmic speedup by quantum walk. In Proc. 35th ACM Symp. on Theory of Computing, San Diego, CA, June 2003.
5. M. Ettinger and P. Høyer. On quantum algorithms for non-commutative hidden subgroups. Advances in Applied Mathematics, 25(3):239-251, 2000.
6. K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen. Hidden translation and orbit coset in quantum computing. In Proc. 35th ACM Symp. on Theory of Computing, 2003.
7. O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. J. Comput. System Sci., 60(3):540-563, 2000.
8. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity, or All languages in NP have zero-knowledge proof systems. J. Assoc. Comput. Mach., 38(3):691-729, 1991.
9. O. Goldreich, D. Micciancio, S. Safra, and J.-P. Seifert. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inform. Process. Lett., 71(2):55-61, 1999.
10. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the non-abelean hidden subgroup problem. In Proc. 33th ACM Symp. on Theory of Computing, pages 68-74, 2001.
11. S. Hallgren. Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proc. 34th ACM Symp. on Theory of Computing, pages 653-658, 2002.
12. J. Kempe and O. Regev. 3-local hamiltonian is QMA-complete. In quant-ph/0302079, http://xxx.lanl.gov, 2003.
13. A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi. Classical and quantum computation, volume 47 of Graduate Studies in Mathematics. AMS, 2002.
14. J. C. Lagarias, H. W. Lenstra, Jr., and C.-P. Schnorr. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, 10(4):333-348, 1990.
15. D. Micciancio. Improving lattice based cryptosystems using the hermite normal form. In Cryptography and Lattices Conference (CaLC), volume 2146 of Lecture Notes in Computer Science, pages 126-145, Providence, Rhode Island, Mar. 2001. Springer-Verlag.
16. D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: a cryptographic perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts, Mar. 2002.
17. O. Regev. Quantum computation and lattice problems. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS) 2002, Vancouver, Canada, Nov. 2002.
18. O. Regev. New lattice based cryptographic constructions. In Proc. 35th ACM Symp. on Theory of Computing, San Diego, CA, June 2003.
19. Z. Sasvári. Positive definite and definitizable functions, volume 2 of Mathematical Topics. Akademie Verlag, Berlin, 1994.
20. M. Schlather. Introduction to positive definite functions and to unconditional simulation of random fields. Technical report ST 99-10, Lancaster University, 1999.
21. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, 1997.
22. A. Shpilka and R. Raz. On the power of quantum proofs. 2002. Unpublished.
23. W. van Dam, S. Hallgren, and L. Ip. Quantum algorithms for some hidden shift problems. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 489-498, 2003.
24. J. Watrous. Succinct quantum proofs for properties of finite groups. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 537-546, 2000.