On the query complexity of perfect gate discrimination

DOI10.4230/LIPICS.TQC.2013.178MaRDI QIDQ2958420zbMATH OpenOpenAlexFDO

Authors Giulio Chiribella, Martin Roetteler, Giacomo Mauro D'Ariano

Publication date 1 February 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2013/4313/pdf/25.pdf

zbMATH Keywords

minimum error discriminationquantum gate identificationquery complexityunambiguous discrimination

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Identification of a reversible quantum gate: assessing the resources
• Some bounds on the minimum number of queries required for quantum channel perfect discrimination
• Quantum query complexity of unitary operator discrimination
• Single-shot discrimination of quantum unitary processes
• Ancilla-assisted discrimination of quantum gates

Cited in

(6)

• Optimal length of decomposition sequences composed of imperfect gates
• Quantum query complexity of unitary operator discrimination
• Some bounds on the minimum number of queries required for quantum channel perfect discrimination
• Ancilla-assisted discrimination of quantum gates
• scientific article; zbMATH DE number 5568624 (Why is no real title available?)
• Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies

This page was built for publication: On the query complexity of perfect gate discrimination

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