Please use this identifier to cite or link to this item:
|Title:||Testing quantum circuits and detecting insecure encryption||Authors:||Rosgen, B.||Issue Date:||2013||Citation:||Rosgen, B. (2013). Testing quantum circuits and detecting insecure encryption. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7582 LNCS : 74-86. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-35656-8_6||Abstract:||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.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/112559||ISBN:||9783642356551||ISSN:||03029743||DOI:||10.1007/978-3-642-35656-8_6|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 3, 2022
checked on Jun 23, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.