Wird geladen...

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Sci Rep
Hauptverfasser: Cao, Tian-Qing, Yang, Ying-Hui, Zhang, Zhi-Chao, Tian, Guo-Jing, Gao, Fei, Wen, Qiao-Yan
Format: Artigo
Sprache:Inglês
Veröffentlicht: Nature Publishing Group 2016
Schlagworte:
Online Zugang: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
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!