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

zbMATH Open1268.81037MaRDI QIDQ3166199FDOQ3166199

Authors: Cheng Lu, Jianxin Chen, Runyao Duan 

Publication date: 21 October 2012

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

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 (4)

• 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
• Base norms and discrimination of generalized quantum channels

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)