File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On the query complexity of perfect gate discrimination

TitleOn the query complexity of perfect gate discrimination
Authors
KeywordsUnambiguous discrimination
Query complexity
Quantum gate identification
Minimum error discrimination
Issue Date2013
Citation
Leibniz International Proceedings in Informatics, LIPIcs, 2013, v. 22, p. 178-191 How to Cite?
Abstract© Giulio Chiribella, Giacomo Mauro D'Ariano, and Martin Roetteler;. 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.
Persistent Identifierhttp://hdl.handle.net/10722/213434
ISSN

 

DC FieldValueLanguage
dc.contributor.authorChiribella, Giulio-
dc.contributor.authorD'Ariano, Giacomo Mauro-
dc.contributor.authorRoetteler, Martin-
dc.date.accessioned2015-07-28T04:07:16Z-
dc.date.available2015-07-28T04:07:16Z-
dc.date.issued2013-
dc.identifier.citationLeibniz International Proceedings in Informatics, LIPIcs, 2013, v. 22, p. 178-191-
dc.identifier.issn1868-8969-
dc.identifier.urihttp://hdl.handle.net/10722/213434-
dc.description.abstract© Giulio Chiribella, Giacomo Mauro D'Ariano, and Martin Roetteler;. 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.-
dc.languageeng-
dc.relation.ispartofLeibniz International Proceedings in Informatics, LIPIcs-
dc.subjectUnambiguous discrimination-
dc.subjectQuery complexity-
dc.subjectQuantum gate identification-
dc.subjectMinimum error discrimination-
dc.titleOn the query complexity of perfect gate discrimination-
dc.typeConference_Paper-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.4230/LIPIcs.TQC.2013.178-
dc.identifier.scopuseid_2-s2.0-84908257007-
dc.identifier.volume22-
dc.identifier.spage178-
dc.identifier.epage191-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats