Entanglement is not necessary for perfect discrimination between unitary operations

From MaRDI portal
Publication:3107901

DOI10.1103/PHYSREVLETT.98.100503zbMATH Open1228.81083arXivquant-ph/0601150WikidataQ79941127 ScholiaQ79941127MaRDI QIDQ3107901FDOQ3107901


Authors: Runyao Duan, Yuan Feng, Mingsheng Ying Edit this on Wikidata


Publication date: 26 December 2011

Published in: Physical Review Letters (Search for Journal in Brave)

Abstract: We 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.


Full work available at URL: https://arxiv.org/abs/quant-ph/0601150




Recommendations



Cites Work


Cited In (23)





This page was built for publication: Entanglement is not necessary for perfect discrimination between unitary operations

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