Cargando…
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...
| Autores principales: | , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4879627/ https://www.ncbi.nlm.nih.gov/pubmed/27221229 http://dx.doi.org/10.1038/srep26696 |