Pith. sign in

REVIEW 2 cited by

Exact quantum query complexity for total Boolean functions

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 quant-ph/0403168 v2 pith:MB5KXYXK submitted 2004-03-23 quant-ph

Gatis Midrijanis This is my paper · ORCID
classification quant-ph
keywords algorithmbooleancomputesexactlymakingquantumqueriesquery
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorithm A that exactly computes f making O(T^3) queries. The best know bound previously was O(T^4) due to Beals et al.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Impossibility of Perfectly Complete Many-Round Key Agreement in the QROM

    quant-ph 2026-08 accept novelty 7.0 of 10

    A polynomial-query classical eavesdropper recovers the shared key with certainty in every perfectly complete many-round QCCC key agreement protocol relative to a quantum-accessible random oracle.

  2. Boolean degree one functions on the Grassmann scheme

    math.CO 2026-06 unverdicted

    Exposition of the result that Boolean degree one functions on J_q(n,k) are trivial when min(k,n-k) >= 2 and n is large enough.

Pith tools