Entropy lower bounds for quantum decision tree complexity

Information Processing Letters

Volumn 81, Issue 1, 2002, Pages 23-27

  Shi, Yaoyun ^a  

^a Princeton University   (United States)

Author keywords

Computational complexity; Decision tree; Entropy; Lower bounds; Quantum computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION TABLES; DECISION THEORY; MATHEMATICAL MODELS; QUANTUM THEORY;

DECISION TREES; QUANTUM COMPUTATIONS;

TREES (MATHEMATICS);

EID: 0037116449     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00191-0     Document Type: Article

References (8)

1. Quantum lower bounds by quantum arguments
2. Quantum lower bounds by polynomials
3. Quantum entanglement and the communication complexity of the inner product function
4. A fast quantum mechanical algorithm for database search
5. Some estimates for the amount of information transmittable by a quantum communications channel
6. Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables