DMCA
2006, Quantum verification of matrix products
by
Harry Buhrman
,
Robert ˇ Spalek
| Venue: | Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms |
| Citations: | 48 - 0 self |
BibTeX
@INPROCEEDINGS{Buhrman_2006,quantum,
author = {Harry Buhrman and Robert ˇ Spalek},
title = {2006, Quantum verification of matrix products},
booktitle = {Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms},
year = {},
pages = {880--889}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a quantum algorithm that verifies a product of two n×n matrices over any integral domain with bounded error in worst-case time O(n 5/3) and expected time O(n 5/3 / min(w, √ n) 1/3), where w is the number of wrong entries. This improves the previous best algorithm [ABH + 02] that runs in time O(n 7/4). We also present a quantum matrix multiplication algorithm that is efficient when the result has few nonzero entries. 1
