2007/05/17 by Lvzhou Li, Daowen Qiu
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics #Computer science #Mathematics #Pauli exclusion principle #Pauli matrices #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum error correction #Quantum mechanics #Quantum state #Qubit #Representation (politics) #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1088/1751-8113/41/33/335302
published as Journal of Physics A: Math. Theor. 41, 335302 (2008). · 6 pages (revtex4 version); comments are welcome
arxiv created 2007/05/17 · openalex publication_date 2008/07/11 · arxiv updated 2010/03/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In this paper, we address the problem of discriminating two given quantum operations. Firstly, based on the Bloch representation of single qubit systems, we give the exact minimum error probability of discriminating two single qubit quantum operations by unentangled input states. In particular, for the Pauli channels discussed in [Phys. Rev. A \bf 71, 062340 (2005)], we use a more intuitional and visual method to deal with their discrimination problem. Secondly, we consider the condition for perfect discrimination of two quantum operations. Specially, we get that two generalized Pauli channels are perfectly distinguishable if and only if their characteristic vectors are orthogonal.