2026-07-23T06:52:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4313 2024-03-06T10:34:49Z ddc:004 open_access

On the Query Complexity of Perfect Gate Discrimination Chiribella, Giulio D'Ariano, Giacomo Mauro Roetteler, Martin quantum gate identification unambiguous discrimination minimum error discrimination query complexity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Giulio Chiribella and Giacomo Mauro D'Ariano and Martin Roetteler 2013 Is Part Of LIPIcs, Volume 22, 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TQC.2013.178 urn:nbn:de:0030-drops-43133 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.178 eng https://creativecommons.org/licenses/by/3.0/legalcode