Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-18073-6_6
DC FieldValue
dc.titleTesting non-isometry is QMA-complete
dc.contributor.authorRosgen, B.
dc.date.accessioned2014-12-12T07:16:23Z
dc.date.available2014-12-12T07:16:23Z
dc.date.issued2011
dc.identifier.citationRosgen, B. (2011). Testing non-isometry is QMA-complete. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6519 LNCS : 63-76. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-18073-6_6" target="_blank">https://doi.org/10.1007/978-3-642-18073-6_6</a>
dc.identifier.isbn3642180728
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/115504
dc.description.abstractDetermining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problem of detecting when a quantum channel implemented as a circuit is close to a linear isometry, and it is shown to be complete for the complexity class QMA of verifiable quantum computation. The main idea is to relate the problem of detecting when a channel is close to an isometry to the problem of determining how mixed the output of the channel can be when the input is a pure state. © 2011 Springer-Verlag.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-18073-6_6
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.description.doi10.1007/978-3-642-18073-6_6
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume6519 LNCS
dc.description.page63-76
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.