Quantum query algorithms are completely bounded forms (Q4634058)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7051431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum query algorithms are completely bounded forms |
scientific article; zbMATH DE number 7051431 |
Statements
Quantum Query Algorithms Are Completely Bounded Forms (English)
0 references
7 May 2019
0 references
quantum algorithms
0 references
query complexity
0 references
multilinear forms
0 references
\(C^*\)-algebras
0 references
operator space theory
0 references
polynomial method
0 references
0 references
0 references
0 references
0.9824908375740052
0 references
0.8403079509735107
0 references
0.7822680473327637
0 references
0.7819953560829163
0 references
0.7780163884162903
0 references
