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

MaRDI QIDQ3166199zbMATH OpenFDO

Authors Cheng Lu, Jianxin Chen, Runyao Duan

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)

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

Cited in

(5)

• Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
• Quantum channel discrimination without entanglement
• Base norms and discrimination of generalized quantum channels
• Fidelity and Fisher information on quantum channels
• On the query complexity of perfect gate discrimination

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)