Pith. sign in

REVIEW

Exact quantum query complexity of EXACT and THRESHOLD

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1302.1235 v1 pith:HWZKA3PX submitted 2013-02-06 quant-ph cs.CC

Andris Ambainis , Jānis Iraids , Juris Smotrovs This is my paper
classification quant-phcs.CC
keywords exactquantuminputalgorithmalgorithmsbitsdetermineproblem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A quantum algorithm is exact if it always produces the correct answer, on any input. Coming up with exact quantum algorithms that substantially outperform the best classical algorithm has been a quite challenging task. In this paper, we present two new exact quantum algorithms for natural problems: 1) for the problem EXACT_k^n in which we have to determine whether the sequence of input bits x_1, ..., x_n contains exactly k values x_i=1; 2) for the problem THRESHOLD_k^n in which we have to determine if at least k of n input bits are equal to 1.

Discussion (0). Sign in to comment.

Pith tools