Some bounds on the minimum number of queries required for quantum channel perfect discrimination

zbMATH Open1268.81037MaRDI QIDQ3166199FDOQ3166199

Cheng Lu, Runyao Duan, Jianxin Chen

Publication date: 21 October 2012

zbMATH Keywords

quantum channelsmaximal fidelity\(q\)-maximal fidelityminimum number of queriesperfect distinguishability

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)

Cited In (3)

• Quantum channel discrimination without entanglement
• Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
• Fidelity and Fisher information on quantum channels

   Recommendations

• Fidelity and Fisher information on quantum channels 👍 👎
• On the Query Complexity of Perfect Gate Discrimination 👍 👎
• Effective quantum channel for minimum error discrimination 👍 👎
• Single-shot discrimination of quantum unitary processes 👍 👎
• Optimal discrimination between quantum operations 👍 👎

This page was built for publication: Some bounds on the minimum number of queries required for quantum channel perfect discrimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166199)