License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2013.178
URN: urn:nbn:de:0030-drops-43133
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4313/
Go to the corresponding LIPIcs Volume Portal

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

On the Query Complexity of Perfect Gate Discrimination

pdf-format:
25.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{chiribella_et_al:LIPIcs:2013:4313,
  author =	{Giulio Chiribella and Giacomo Mauro D'Ariano and Martin Roetteler},
  title =	{{On the Query Complexity of Perfect Gate Discrimination}},
  booktitle =	{8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)},
  pages =	{178--191},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-55-2},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{22},
  editor =	{Simone Severini and Fernando Brandao},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4313},
  URN =		{urn:nbn:de:0030-drops-43133},
  doi =		{10.4230/LIPIcs.TQC.2013.178},
  annote =	{Keywords: quantum gate identification, unambiguous discrimination, minimum error discrimination, query complexity}
}

Keywords: quantum gate identification, unambiguous discrimination, minimum error discrimination, query complexity
Collection: 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)
Issue Date: 2013
Date of publication: 13.11.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI