We show that the computational problem of testing the behaviour of quantum circuits is hard for the class QMA of problems that can be verified efficiently with a quantum computer. This result generalizes techniques previously used to prove the hardness of other problems on quantum circuits.We use this result to show the QMA-completeness of a weak version of the problem of detecting the insecurity of a symmetrickey quantum encryption system or alternately the problem of determining when a quantum channel is not private. © Springer-Verlag Berlin Heidelberg 2013.
CITATION STYLE
Rosgen, B. (2013). Testing quantum circuits and detecting insecure encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7582 LNCS, pp. 74–86). https://doi.org/10.1007/978-3-642-35656-8_6
Mendeley helps you to discover research relevant for your work.