Component mixers and a hardness result for counterfeiting quantum money

Details Component mixers and a hardness result for counterfeiting quantum money Component mixers and a hardness result for counterfeiting quantum money

2011-07-01

arxiv.org/abs/1107.0321v1

Physics

Quantum Physics

14 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Component mixers and a hardness result for counterfeiting quantum money does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Component mixers and a hardness result for counterfeiting quantum money, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Component mixers and a hardness result for counterfeiting quantum money will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174868