Quantum query complexity and semi-definite programming

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 179-193

  Barnum, Howard ^a   Saks, Michael ^b   Szegedy, Mario ^c  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATRIX ALGEBRA; ANALOG COMPUTERS; BOOLEAN FUNCTIONS; COMPUTER PROGRAMMING; COMPUTER SCIENCE; DECISION TREES; INTEGER PROGRAMMING; LABORATORIES; LINEAR MATRIX INEQUALITIES; POLYNOMIALS; QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY;

SEMI-DEFINITE PROGRAMMING;

COMPUTER SCIENCE; MATRIX ALGEBRA;

COMPUTATIONAL POWER; EQUATIONS; MINIMUM PROBABILITY OF ERROR; POSITIVE SEMIDEFINITE MATRICES; QUANTUM COMPUTING; QUANTUM QUERY ALGORITHM; QUANTUM QUERY COMPLEXITY; SEMI-DEFINITE PROGRAMMING;

EID: 0043016194     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. S. Aaronson, "Algorithms for Boolean function query properties," to appear in SIAM Journal on Computing.
2. F. Alizadeh, "Interior point methods in semidefinite programming with applications to combinatorial optimization," SIAM J. Optimization, 5 (1995), pp. 13-51.
3. A. Ambainis, "Quantum lower bounds by quantum arguments," Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (STOC), pp. 636-643, 2000.
4. A. Ambainis, "Quantum lower bounds by quantum arguments," Journal of Computer and System Sciences, 64(2002), pp. 750-767.
5. H. Barnum, M. E. Saks "A lower bound on the quantum query complexity of read-once functions," Electronic Colloquium on Computational Complexity (ECCC)(002): (2002)
6. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, "Quantum lower bounds by polynomials," Proc. 39th IEEE Symp. on Foundations of Comp. Sci.(FOCS), 1998, pp. 352-361.
7. C. H. Bennett, G. Brassard, E. Bernstein, and U. Vazirani, "Strengths and weaknesses of quantum computing," SIAM Journal on Computing, 26 (1997), pp. 1510-1523.
8. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization Algorithms and Combinatorics 2, Springer-Verlag, Berlin, 1988.
9. Lov Grover, "A fast quantum mechanical algorithm for database search," Proc. 28th ACM Symp. on Theory of Computing (STOC), 1998, pp. 212-219.
10. L. Grover, "Quantum mechanics helps in searching for a needle in a haystack," Physical Review Letters, 79(1997) pp. 325-328.
11. P. Hoyer, J. Neerbek, and Y.Shi, "Quantum bounds for ordered searching and sorting," Proc. 28th Int. Coll. on Automata Lang, and Prog. (ICALP), 2001, Lecture Notes in Computer Science, vol. 2076, Springer-Verlag, New York, pp. 346-357.
12. P. Hoyer, J. Neerbek, Y. Shi, "Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness" Algorithmica 34 (2002) pp. 429-448.
13. A. Kitaev "Any quantum coin tossing protocol is subject to same-sided bias", 2002, unpublished.
14. H. Mine, Nonnegative Matrices, Wiley-Interscience, New York, 1988.
15. A. Nayak, personal communication.
16. M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information Cambridge University Press, Cambridge, 2000.
17. A. Peres, Quantum Theory: Concepts and Methods, Kluwer Academic, Dordrecht, 1993.
18. R.T. Rockafeller, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
19. P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring," Proc. 37th Ann. Symp. on the Foundations of Comp. Sci. (FOCS), 1994, pp. 56-65.
20. P. W. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," SIAM J. Comp. 26 (1997) pp. 1484-1509.