Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester (Q4601846)
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 6829294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester |
scientific article; zbMATH DE number 6829294 |
Statements
24 January 2018
0 references
quantum algorithms
0 references
query complexity
0 references
Elitzur-Vaidman bomb tester
0 references
adversary method
0 references
maximum bipartite matching
0 references
0.7796035408973694
0 references
0.778276801109314
0 references
0.7737758755683899
0 references
0.7689992189407349
0 references
