Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-18073-6_6
Title: Testing non-isometry is QMA-complete
Authors: Rosgen, B. 
Issue Date: 2011
Source: Rosgen, 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. https://doi.org/10.1007/978-3-642-18073-6_6
Abstract: Determining 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.
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/115504
ISBN: 3642180728
ISSN: 03029743
DOI: 10.1007/978-3-642-18073-6_6
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

4
checked on Jan 17, 2018

Page view(s)

26
checked on Jan 14, 2018

Google ScholarTM

Check

Altmetric


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