Entropy lower bounds for quantum decision tree complexity (Q1847373): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/0008095 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantum lower bounds by quantum arguments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4939137 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4228473 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017671677 / rank | |||
Normal rank | |||
Latest revision as of 09:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Entropy lower bounds for quantum decision tree complexity |
scientific article |
Statements
Entropy lower bounds for quantum decision tree complexity (English)
0 references
24 June 2003
0 references
entropy
0 references
random variable
0 references
