Pith. sign in

REVIEW 1 cited by

Component mixers and a hardness result for counterfeiting quantum money

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 1107.0321 v1 pith:XCJG3JWH submitted 2011-07-01 quant-ph

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

In this paper we give the first proof that, under reasonable assumptions, a problem related to counterfeiting quantum money from knots [Farhi et al. 2010] is hard. Along the way, we introduce the concept of a component mixer, define three new classical query problems and associated complexity classes related to graph isomorphism and group membership, and conjecture an oracle separating QCMA from QMA.

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. QMA vs. QCMA and Pseudorandomness

    quant-ph 2024-11 conditional novelty 8.0 of 10

    Assuming a quantum pseudorandomness conjecture for dense permutation distributions, there exists a classical oracle relative to which QMA differs from QCMA.

Pith tools