Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision - CNRS - Centre national de la recherche scientifique Access content directly
Journal Articles Algorithmica Year : 2016

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision

Stacey Jeffery
  • Function : Author
Robin Kothari
  • Function : Author
François Le Gall
  • Function : Author

Dates and versions

hal-03753527 , version 1 (18-08-2022)

Identifiers

Cite

Stacey Jeffery, Robin Kothari, François Le Gall, Frédéric Magniez. Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. Algorithmica, 2016, 76 (1), pp.1-16. ⟨10.1007/s00453-015-9985-x⟩. ⟨hal-03753527⟩
12 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More