Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

O*( \min \{n^{1/3} L^{17/{3}0}, n^{1.5} L^{1/4}\})

Space Complexity

()

Description

Approximate?

Exact

Randomized?

Yes,

Model of Computation

Quantum

Year

2018

Reference

https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 1.6