A lower bound on the quantum query complexity of read-once functions (Q1880783)
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 2104537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the quantum query complexity of read-once functions |
scientific article; zbMATH DE number 2104537 |
Statements
A lower bound on the quantum query complexity of read-once functions (English)
0 references
1 October 2004
0 references
Quantum query complexity
0 references
Quantum computation
0 references
Query complexity
0 references
Decision tree complexity
0 references
Read-once functions
0 references
Lower bounds
0 references
0 references
0.844360888004303
0 references
0.8380197882652283
0 references
0.8353398442268372
0 references
0.8333045840263367
0 references
0.8231950998306274
0 references
