Physics – Quantum Physics
Scientific paper
2011-08-04
Physics
Quantum Physics
15 pages
Scientific paper
We show that computational problem of testing the behaviour of quantum circuits is hard for the class of problems known as QMA that can be verified efficiently with a quantum computer. This result is a generalization of the techniques previously used to prove the hardness of other problem on quantum circuits. We use this result to show the QMA-hardness of a weak version of the problem of detecting the insecurity of a symmetric-key quantum encryption system, or alternately the problem of determining when a quantum channel is not private. We also give a QMA protocol for the problem of detecting insecure encryption to show that it is QMA-complete.
No associations
LandOfFree
Testing quantum circuits and detecting insecure encryption 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 Testing quantum circuits and detecting insecure encryption, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing quantum circuits and detecting insecure encryption will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-14197