On the efficiency of nonlocal gates generation
| dc.creator | Groisman, Berry | |
| dc.creator | Reznik, Benni | |
| dc.date | 2004-10-21 | |
| dc.date.accessioned | 2026-07-07T06:25:25Z | |
| dc.date.available | 2026-07-07T06:25:25Z | |
| dc.description | We propose and study a method for using non-maximally entangled states to implement probabilistically non-local gates. Unlike distillation-based protocols, this method does not generate a maximally entangled state at intermediate stages of the process. As a consequences, the method becomes more efficient at a certain range of parameters. Gates of the form $\exp[iξσ_{n_A}σ_{n_B}]$ with $ξ\ll1$, can be implemented with nearly unit probability and with vanishingly small entanglement, while for the distillation-based method the gate is produced with a vanishing success probability. We also derive an upper bound to the optimal success probability and show that in the small entanglement limit, the bound is tight. | |
| dc.description | 6 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0410170 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0410170 | |
| dc.identifier | Phys. Rev. A 71, 032322 (2005) | |
| dc.identifier | doi:10.1103/PhysRevA.71.032322 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/96824 | |
| dc.subject | Quantum Physics | |
| dc.title | On the efficiency of nonlocal gates generation | |
| dc.type | text |