Quick Navigation
Topics
Quantum Optimization
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
arXiv
Authors: Rahul Jain, Hartmut Klauck, Miklos Santha
Year
2010
Paper ID
9095
Status
Preprint
Abstract Read
~2 min
Abstract Words
62
Citations
N/A
Abstract
A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations. We also note that a near optimal Direct Sum Theorem holds for quantum decision trees for boolean functions.
Why This Paper Matters
- This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
- It adds a 2010 reference point for readers tracking recent quantum research.
- A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.