REVIEW 1 cited by
A new quantum lower bound method, with an application to strong direct product theorem for quantum search
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem. Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proven by Klauck, Spalek and de Wolf (quant-ph/0402123) using polynomials method. No proof using adversary method was known before.
Forward citations
Cited by 1 Pith paper
-
The Compressed Oracle is a Worthy (Multiplicative) Adversary
The compressed oracle technique is captured by the multiplicative adversary method through the new multiplicative ladder adversary method, up to a factor of 6.
Discussion (0). Continue with ORCID to comment.