Decision problems with quantum black boxes

From MaRDI portal
Publication:3568940

DOI10.1080/09500340903203129zbMATH Open1190.81003arXiv1109.4823OpenAlexW1989395504WikidataQ59437499 ScholiaQ59437499MaRDI QIDQ3568940FDOQ3568940


Authors: Mark Hillery, Erika Andersson, Stephen M. Barnett, Daniel K. L. Oi Edit this on Wikidata


Publication date: 16 June 2010

Published in: Journal of Modern Optics (Search for Journal in Brave)

Abstract: We examine how to distinguish between unitary operators, when the exact form of the possible operators is not known. Instead we are supplied with "programs" in the form of unitary transforms, which can be used as references for identifying the unknown unitary transform. All unitary transforms should be used as few times as possible. This situation is analoguous to programmable state discrimination. One difference, however, is that the quantum state to which we apply the unitary transforms may be entangled, leading to a richer variety of possible strategies. By suitable selection of an input state and generalized measurement of the output state, both unambiguous and minimum-error discrimination can be achieved. Pairwise comparison of operators, comparing each transform to be identified with a program transform, is often a useful strategy. There are, however, situations in which more complicated strategies perform better. This is the case especially when the number of allowed applications of program operations is different from the number of the transforms to be identified.


Full work available at URL: https://arxiv.org/abs/1109.4823




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Decision problems with quantum black boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568940)