Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations

Simple item page
dc.creatorDuan, Runyao
dc.creatorFeng, Yuan
dc.creatorYing, Mingsheng
dc.date2006-01-22
dc.date2007-03-26
dc.date.accessioned2026-07-07T07:53:41Z
dc.date.available2026-07-07T07:53:41Z
dc.descriptionWe show that a unitary operation (quantum circuit) secretely chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations is required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.
dc.description4 pages(in Revtex4), 2 figures (eps). Corrected some typos and two equations. Main results unchanged. Essentially the journal version
dc.identifierhttps://arxiv.org/abs/quant-ph/0601150
dc.identifierhttp://arxiv.org/abs/quant-ph/0601150
dc.identifierPhysical Review Letters, vol. 98, no. 10, art. 100503, 2007
dc.identifierdoi:10.1103/PhysRevLett.98.100503
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126316
dc.subjectQuantum Physics
dc.titleEntanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
dc.typetext

Files

Collections

arXiv