Back to Results
First PageMeta Content
Models of computation / Decision tree model / Binary trees / Quantum algorithm / PP / Randomized algorithm / Quantum computer / Random binary tree / Switching lemma / Theoretical computer science / Applied mathematics / Computational complexity theory


Almost all decision trees do not allow significant quantum speed-up
Add to Reading List

Document Date: 2012-12-14 16:07:15

Open Document

File Size: 166,55 KB

Share Result on Facebook

Company

Creative Commons / Cambridge University Press / /

Country

United Kingdom / /

Facility

W. VAN DAM / University of Cambridge / /

IndustryTerm

classical algorithms / classical query algorithms / quantum algorithm / query-efficient quantum algorithms / quantum algorithms / few efficient algorithms / /

Organization

Department of Applied Mathematics / Centre for Quantum Information and Foundations / Cambridge University / Department of Applied Mathematics and Theoretical Physics / American Mathematical Society / University of Cambridge / /

Person

Ashley Montanaro / Ashley Montanaro Licensed / Tony Short / /

Position

AUTHOR / /

Product

Theorem 3 / /

PublishedMedium

Theoretical Computer Science / /

Technology

quantum algorithm / quantum algorithms / classical query algorithms / /

URL

http /

SocialTag