The quantum query complexity of 0-1 Knapsack and associated claw problems

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

Volumn 2906, Issue , 2003, Pages 168-177

  Arvind, V ^a   Schuler, Rainer ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; QUANTUM THEORY;

0-1 KNAPSACK PROBLEM; CNF FORMULAS; INTEGER LINEAR PROGRAMS; LOWER BOUNDS; QUANTUM ALGORITHMS; QUANTUM QUERY COMPLEXITY; SATISFIABILITY; UPPER BOUND;

INTEGER PROGRAMMING;

EID: 35248900995     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_19     Document Type: Article

References (12)

1. S. AARONSON, Quantum Lower Bound for the Collision Problem. Proceedings of the 34th Annual ACM Symp. on Theory of Computing, 2002, pp. 635-642.
2. A. AMBAINIS, Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences, 64(2002), pp. 750-767.
3. C.H. BENNETT, E. BERNSTEIN, G. BRASSARD, U. VAZIRANI, Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5), 1997, pp. 1510-1523.
4. HARRY BUHRMAN, RONALD DE WOLF, CHRISTOPH DURR, MARK HEILIGMAN, PETER HOYER, FREDERIC MAGNIEZ, MIKLOS SANTHA, Quantum Algorithms for Element Distinctness. 16th Annual Conference on Computational Complexity, 2001, pp. 131-137.
5. G. BRASSARD, P. HOYER, M. MOSCA, A. TAPP, Quantum amplitude amplification and estimation. In Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Mathematics Series, 2002, to appear.
6. R. CLEVE, An introduction to quantum complexity theory. quant-ph/9906111, 1999.
7. L.K. GROVER, A fast quantum mechanical algorithm for database search. Proceedings of 28th Symp of Theory of Computing, 1996, pp. 212-219.
8. G.L. NEMHAUSER, L. A. WOLSEY, Integer and Combinatorial Optimization. Wiley-Interscience Series, New York, 1988.
9. RAMAMOHAN PATURI, PAVEL PUDLAK, FRANCIS ZANE, Satisfiability Coding Lemma, Chicago Journal of Theoretical Computer Science, 11, 31 December, 1999
10. F.P. PREPARATA, M.I. SHAMOS, Computational Geometry: An Introduction. Springer Verlag, New York Inc., 1985.
11. P.W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1997, pp. 1484-1509.
12. Y. SHI, Quantum lower bounds for the collision and the element distinctness problems. Proceedings of the 43rd Symposium on the Foundations of Computer Science, 513-519, 2002.