Optimal universal programmable detectors for unambiguous discrimination

Simple item page
dc.creatorZhang, Chi
dc.creatorYing, Mingsheng
dc.creatorQiao, Bo
dc.date2005-12-04
dc.date2006-10-16
dc.date.accessioned2026-07-07T06:56:31Z
dc.date.available2026-07-07T06:56:31Z
dc.descriptionWe discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two kinds of input registers: the program registers and the data register. The quantum state in the data register is what users want to identify, which is confirmed to be among the n states in program registers. The task of the discriminator is to tell the users which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discriminator. Then, if $m=n$, we present an optimal unambiguous programmable discriminator for them, in the sense of maximizing the worst-case probability of success. Finally, we propose a universal unambiguous programmable discriminator for arbitrary n quantum states.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0512029
dc.identifierhttp://arxiv.org/abs/quant-ph/0512029
dc.identifierPhys. Rev. A, 74, 042308, 2006
dc.identifierdoi:10.1103/PhysRevA.74.042308
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106669
dc.subjectQuantum Physics
dc.titleOptimal universal programmable detectors for unambiguous discrimination
dc.typetext

Files

Collections

arXiv