Quantum verification of matrix products

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 880-889

  Buhrman, Harry ^a   Špalek, Robert ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRAL DOMAIN; MATRIX PRODUCTS; QUANTUM MATRIX MULTIPLICATION ALGORITHM; QUANTUM VERIFICATION;

ALGORITHMS; ERROR ANALYSIS; MATRIX ALGEBRA;

QUANTUM THEORY;

EID: 33244486120     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109654     Document Type: Conference Paper

References (23)

1. A. Ambainis. Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences, 64:750-767, 2002. Earlier version in STOC'00.
2. A. Ambainis. Quantum walk algorithm for element distinctness. In Proc. of 45th IEEE FOCS, pages 22-31, 2004.
3. A. Ambainis, H. Buhrman, P. Høyer, M. Karpinski, and P. Kurur. Quantum matrix verification. Unpublished Manuscript, 2002.
4. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. Journal of the ACM, 48(4):778-797, 2001. Earlier version in FOCS'98.
5. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte der Physik, 46(4-5):493-505, 1998. Earlier version in Physcomp'96.
6. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In Quantum Computation and Quantum Information: A Millennium Volume, volume 305 of AMS Contemporary Mathematics Series, pages 53-74. 2002.
7. H. Buhrman, Ch. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. In Proc. of 16th IEEE Complexity, pages 131-137, 2001.
8. D. Coppersmith. Rectangular matrix multiplication revisited. Journal of Complexity, 13:42-49, 1997.
9. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of symbolic computation, 9:251-280, 1990. Earlier version in STOC'87.
10. R. Freivalds. Fast probabilistic algorithms. In Proc. of 8th Symp. on Math. Foundations of Computer Science, pages 57-69. Springer Verlag, 1979. LNCS 74.
11. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proc. of 28th ACM STOC, pages 212-219, 1996.
12. P. Høyer, M. Mosca, and R. de Wolf. Quantum search on bounded-error inputs. In Proc. of 30th ICALP, pages 291-299, 2003. LNCS 2719.
13. P. Indyk. Output-sensitive algorithm for matrix multiplication. Manuscript, 2005.
14. H. Klauck, R. Špalek, and R. de Wolf. Quantum and classical strong direct product theorems and optimal time-space tradeoffs. In Proc. of 45th IEEE FOCS, pages 12-21, 2004.
15. D. E. Knuth. Combinatorial matrices. In Selected Papers on Discrete Mathematics, volume 106 of CSLI Lecture Notes. Stanford University, 2003.
16. F. Magniez and A. Nayak. Quantum complexity of testing group commutativity. In Proc. of 32nd ICALP, pages 1312-1324, 2005. LNCS 3580.
17. F. Magniez, M. Santha, and M. Szegedy. Quantum algorithms for the triangle problem. In Proc. of 16th ACM-SIAM SODA, pages 1109-1117, 2005.
18. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
19. R. Špalek and M. Szegedy. All quantum adversary methods are equivalent. In Proc. of 32nd ICALP, pages 1299-1311, 2005. LNCS 3580.
20. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
21. M. Szegedy. Quantum speed-up of Markov chain based algorithms. In Proc. of 45th IEEE FOCS, pages 32-41, 2004.
22. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(1):85-93, 1986.
23. R. Yuster and U. Zwick. Fast sparse matrix multiplication. In Proc. of 12th RSA, pages 604-615, 2004.