2009/10/20 by Bill Rosgen, Rosgen, Bill
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.0910.3740
openalex publication_date 2009/10/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. This is done by relating 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. How mixed the output of the channel is can be detected by a protocol making use of the swap test: this follows from the fact that an isometry applied twice in parallel does not affect the symmetry of the input state under the swap operation.