pith. sign in

arxiv: 1107.0321 · v1 · pith:XCJG3JWHnew · submitted 2011-07-01 · 🪐 quant-ph

Component mixers and a hardness result for counterfeiting quantum money

Andrew Lutomirski This is my paper
classification 🪐 quant-ph
keywords componentcounterfeitingmoneyquantumrelatedalongassociatedassumptions
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. En Route to a Standard QMA1 vs. QCMA Oracle Separation

    quant-ph 2026-04 unverdicted novelty 6.0

    A classical oracle is built such that a language is in QMA1 but not in QCMA under polynomially adaptive rounds and exponential parallel queries, plus a derandomized in-place separation.