Oct 20, 2009 · 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 ...

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 ...

Jun 1, 2010 · In this paper it is shown that this problem is QMA-complete when the input computation is modelled as a quantum circuit consisting of the usual ...

Testing Non-isometry Is QMA-Complete. Bill Rosgen(. Singapore Natl. U. ) 2011. 14 pages. Published in: Lect.Notes Comput.Sci. 6519 (2011) 63-76. Contribution to ...

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 ...

The main idea is to relate the problem of detecting when a quantum channel is close to an isometry to theproblem of determining how mixed the output of the ...

In this paper we generalize the hardness proofs of [13, 18] to show that the QMA-hardness of the problem of testing the properties of the outputs of quantum ...

Contents. TQC'10: Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography. Testing non-isometry is QMA-complete.

Abstract. Determining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problem.

Testing Non-isometry Is QMA-Complete. https://doi.org/10.1007/978-3-642-18073-6_6 · Full text. Journal: Theory of Quantum Computation, Communication, and ...