A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication
From MaRDI portal
Publication:4909580
DOI10.1007/978-3-642-35261-4_66zbMath1260.68146arXiv1201.6174OpenAlexW2963978410MaRDI QIDQ4909580
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.6174
Numerical computation of matrix norms, conditioning, scaling (65F35) Boolean and Hadamard matrices (15B34) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products ⋮ Improving quantum query complexity of Boolean matrix multiplication using graph collision ⋮ Quantum Complexity of Boolean Matrix Multiplication and Related Problems
This page was built for publication: A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication
