Rooted-tree network for optimal non-local gate implementation
Nilesh Vyas , Debashis Saha , Prasanta K. Panigrahi
AbstractA general quantum network for implementing non-local control-unitary gates, between remote parties at minimal entanglement cost, is shown to be a rooted-tree structure. Starting from a five-party scenario, we demonstrate the local implementation of simultaneous class of control-unitary(Hermitian) and multiparty control-unitary gates in an arbitrary n-party network. Previously, established networks are turned out to be special cases of this general construct.
|Journal series||Quantum Information Processing, ISSN 1570-0755|
|Publication size in sheets||0.6|
|Keywords in English||gate teleportation, local operation and classical communication (LOCC), control-unitary gates, rooted tree|
|Score|| = 35.0, 20-12-2017, ArticleFromJournal|
= 40.0, 20-12-2017, ArticleFromJournal
|Publication indicators||: 2016 = 2.192 (2) - 2016=2.337 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.