Entropy lower bounds for quantum decision tree complexity

DOI10.1016/S0020-0190(01)00191-0zbMath1047.68072arXivquant-ph/0008095OpenAlexW2017671677MaRDI QIDQ1847373

Yaoyun Shi

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0008095

zbMATH Keywords

entropyrandom variable

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Entropy bounds for dendrimers ⋮ Quantum decision tree classifier ⋮ Quantum lower bounds by entropy numbers ⋮ Extremality of degree-based graph entropies

Cites Work

• Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
• Quantum lower bounds by quantum arguments
• Unnamed Item
• Unnamed Item

This page was built for publication: Entropy lower bounds for quantum decision tree complexity