File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Identification of a reversible quantum gate: Assessing the resources

TitleIdentification of a reversible quantum gate: Assessing the resources
Authors
Issue Date2013
Citation
New Journal of Physics, 2013, v. 15 How to Cite?
AbstractWe assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies, we consider unambiguous gate discrimination - where errors are not tolerated but inconclusive outcomes are allowed - and we prove that parallel strategies are sufficient to unambiguously identify the unknown gate with minimum number of queries. This result is used to provide upper and lower bounds on the query complexity and on the minimum ancilla dimension. 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 give an explicit expression for the maximum probability of correct gate identification and we prove that there is no gap between the performances of deterministic strategies and those of probabilistic strategies. Hence, evaluating of the query complexity of perfect deterministic discrimination is reduced to the easier problem of evaluating the query complexity of unambiguous discrimination. Finally, we consider discrimination strategies where the use of ancillas is forbidden, providing upper bounds on the number of additional queries needed to make up for the lack of entanglement with the ancillas. © IOP Publishing and Deutsche Physikalische Gesellschaft.
Persistent Identifierhttp://hdl.handle.net/10722/213363
ISSN
2015 Impact Factor: 3.57
2015 SCImago Journal Rankings: 1.902
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChiribella, Giulio-
dc.contributor.authorD'Ariano, Giacomo Mauro-
dc.contributor.authorRoetteler, Martin-
dc.date.accessioned2015-07-28T04:07:01Z-
dc.date.available2015-07-28T04:07:01Z-
dc.date.issued2013-
dc.identifier.citationNew Journal of Physics, 2013, v. 15-
dc.identifier.issn1367-2630-
dc.identifier.urihttp://hdl.handle.net/10722/213363-
dc.description.abstractWe assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies, we consider unambiguous gate discrimination - where errors are not tolerated but inconclusive outcomes are allowed - and we prove that parallel strategies are sufficient to unambiguously identify the unknown gate with minimum number of queries. This result is used to provide upper and lower bounds on the query complexity and on the minimum ancilla dimension. 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 give an explicit expression for the maximum probability of correct gate identification and we prove that there is no gap between the performances of deterministic strategies and those of probabilistic strategies. Hence, evaluating of the query complexity of perfect deterministic discrimination is reduced to the easier problem of evaluating the query complexity of unambiguous discrimination. Finally, we consider discrimination strategies where the use of ancillas is forbidden, providing upper bounds on the number of additional queries needed to make up for the lack of entanglement with the ancillas. © IOP Publishing and Deutsche Physikalische Gesellschaft.-
dc.languageeng-
dc.relation.ispartofNew Journal of Physics-
dc.titleIdentification of a reversible quantum gate: Assessing the resources-
dc.typeArticle-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1088/1367-2630/15/10/103019-
dc.identifier.scopuseid_2-s2.0-84886534101-
dc.identifier.volume15-
dc.identifier.isiWOS:000325748300005-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats