On the Query Complexity of Perfect Gate Discrimination

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

Thumbnail PDF


  • Filesize: 471 kB
  • 14 pages

Document Identifiers

Author Details

Giulio Chiribella
Giacomo Mauro D'Ariano
Martin Roetteler

Cite AsGet BibTex

Giulio Chiribella, Giacomo Mauro D'Ariano, and Martin Roetteler. On the Query Complexity of Perfect Gate Discrimination. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 178-191, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


We investigate the problem of finding the minimum number of queries needed to perfectly identify an unknown quantum gate within a finite set of alternatives, considering both deterministic strategies. For unambiguous gate discrimination, where errors are not tolerated but inconclusive outcomes are allowed, we prove that parallel strategies are sufficient to identify the unknown gate with minimum number of queries and we use this fact to provide upper and lower bounds on the query complexity. In addition, we introduce the notion of generalized $t$-designs, which includes unitary t-designs and group representations as special cases. For gates forming a generalized $t$-design we prove that there is no difference between perfect probabilistic and perfect deterministic gate discrimination. Hence, evaluating of the query complexity of perfect discrimination is reduced to the easier problem of evaluating the query complexity of unambiguous discrimination.
  • quantum gate identification
  • unambiguous discrimination
  • minimum error discrimination
  • query complexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail