Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915)
From MaRDI portal
(Redirected from Item:Q2843277)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improving quantum query complexity of Boolean matrix multiplication using graph collision |
scientific article; zbMATH DE number 6197700
- Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving quantum query complexity of Boolean matrix multiplication using graph collision |
scientific article; zbMATH DE number 6197700 |
|
Statements
Improving quantum query complexity of Boolean matrix multiplication using graph collision (English)
0 references
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (English)
0 references
1 November 2016
0 references
12 August 2013
0 references
quantum algorithms
0 references
Boolean matrix multiplication
0 references
query complexity
0 references
0 references
0 references
0.9999999
0 references
0.9101904
0 references
0.8863072
0 references
0.87759155
0 references
0 references
0.8724782
0 references
0.8671068
0 references
0.8592962
0 references