Pith. sign in

REVIEW 1 cited by

Quantum Zero-Error Algorithms Cannot be Composed

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

arxiv quant-ph/0211029 v2 pith:UHYMROFS submitted 2002-11-06 quant-ph cs.CC

classification quant-phcs.CC
keywords quantumzero-erroralgorithmalgorithmscannotcomposedefficientalways
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed. In oracle terms, we give a relativized world where ZQP^{ZQP}\=ZQP, while classically we always have ZPP^{ZPP}=ZPP.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Composing Quantum Algorithms

    quant-ph 2025-02 unverdicted novelty 2.0 of 10

    A survey explaining that bounded-error quantum algorithms can be composed without the log factor that classical randomized composition requires, using the transducer model.

Pith tools