## Entropy lower bounds of quantum decision tree complexity

*Shi, Yaoyun*;

- Subject: Quantum Physicsacm: TheoryofComputation_GENERAL

We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard the computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round consisting of O(log(n)) bits. Le... View more

- References (6)
- Related Organizations (4)
Princeton University ( Princeton University ) United StatesWebsite url: http://www.princeton.edu/main/90%PRINCETON UNIVERSITY 90%Princeton University 90%Princeton University 90% - Metrics

Share - Bookmark

- Download from

- Funded by