Carregant...

Minimal number of runs and the sequential scheme for local discrimination between special unitary operations

It has been shown that any two different multipartite unitary operations are perfectly distinguishable by local operations and classical communication with a finite number of runs. Meanwhile, two open questions were left. One is how to determine the minimal number of runs needed for the local discri...

Descripció completa

Guardat en:
Dades bibliogràfiques
Publicat a:Sci Rep
Autors principals: Cao, Tian-Qing, Yang, Ying-Hui, Zhang, Zhi-Chao, Tian, Guo-Jing, Gao, Fei, Wen, Qiao-Yan
Format: Artigo
Idioma:Inglês
Publicat: Nature Publishing Group 2016
Matèries:
Accés en línia:https://ncbi.nlm.nih.gov/pmc/articles/PMC4879627/
https://ncbi.nlm.nih.gov/pubmed/27221229
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/srep26696
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!