File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.4230/LIPIcs.TQC.2013.178
- Scopus: eid_2-s2.0-84908257007
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: On the query complexity of perfect gate discrimination
Title | On the query complexity of perfect gate discrimination |
---|---|
Authors | |
Keywords | Unambiguous discrimination Query complexity Quantum gate identification Minimum error discrimination |
Issue Date | 2013 |
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 Identifier | http://hdl.handle.net/10722/213434 |
ISSN | 2023 SCImago Journal Rankings: 0.796 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chiribella, Giulio | - |
dc.contributor.author | D'Ariano, Giacomo Mauro | - |
dc.contributor.author | Roetteler, Martin | - |
dc.date.accessioned | 2015-07-28T04:07:16Z | - |
dc.date.available | 2015-07-28T04:07:16Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Leibniz International Proceedings in Informatics, LIPIcs, 2013, v. 22, p. 178-191 | - |
dc.identifier.issn | 1868-8969 | - |
dc.identifier.uri | http://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.language | eng | - |
dc.relation.ispartof | Leibniz International Proceedings in Informatics, LIPIcs | - |
dc.subject | Unambiguous discrimination | - |
dc.subject | Query complexity | - |
dc.subject | Quantum gate identification | - |
dc.subject | Minimum error discrimination | - |
dc.title | On the query complexity of perfect gate discrimination | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.4230/LIPIcs.TQC.2013.178 | - |
dc.identifier.scopus | eid_2-s2.0-84908257007 | - |
dc.identifier.volume | 22 | - |
dc.identifier.spage | 178 | - |
dc.identifier.epage | 191 | - |
dc.identifier.issnl | 1868-8969 | - |