Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physics Letters A

Efficient implementation of a nonlocal gate with nonmaximal entanglement

Chunmei Yao, Binfang Cao

Published Jan 27, 2009• 10 citations
Publisher
DOI
10.1016/j.physleta.2009.01.039

Related papers

Implementing a Nonlocal Toffoli Gate Using Partially Entangled Qubit Pairs

Libing Chen, Haiping Lu

International Journal of Theoretical Physics•Jun 8, 2011•5 citations

Nonmaximal Entanglement Preparation

Mladen Pavičić

European Quantum Electronics Conference (EQEC)•Jan 1, 1996•0 citations

Probabilistic implementation of a nonlocal operation using a nonmaximally entangled state

Lin Chen, Yi-Xin Chen

We develop the probabilistic implementation of a nonlocal gate $\mathrm{exp}[i\ensuremath{\xi}{\ensuremath{\sigma}}_{{n}_{A}}{\ensuremath{\sigma}}_{{n}_{B}}]$ and $\ensuremath{\xi}∊[0,(\ensuremath{\pi}∕4)]$, by using a single nonmaximally entangled state. We prove that nonlocal gates can be implemented with a fidelity of $>79.3%$ and a consumption of $<0.969\phantom{\rule{0.3em}{0ex}}\mathrm{ebits}$ and two classical bits, when $\ensuremath{\xi}\ensuremath{\leqslant}0.353$. This provides a higher bound for the feasible operation compared to the former techniques. Besides, gates with $\ensuremath{\xi}\ensuremath{\geqslant}0.353$ can be implemented with the probability 79.3% and a consumption of 0.969 ebits, which is the same efficiency as the distillation-based protocol, while our method saves extra classical resources. Gates with $\ensuremath{\xi}\ensuremath{\rightarrow}0$ can be implemented with nearly unit probability and a small entanglement. We also generalize some applications to the multiple system, where we find it is possible to implement certain nonlocal gates between many nonentangled partners using a nonmaximally multiple entangled state.

arXiv:quant-ph/0501107•Physical Review A•May 17, 2005•28 citations

Implementing nonlocal gates with nonmaximally entangled states

Berry Groisman, Benni Reznik

We propose and study a method for using nonmaximally entangled states to probabilistically implement desired nonlocal gates. Unlike distillation-based protocols, this method does not generate a maximally entangled state at intermediate stages of the process. As a consequence, the method becomes more efficient at a certain range of parameters. Gates of the form $\mathrm{exp}[i\ensuremath{\xi}{\ensuremath{\sigma}}_{{n}_{A}}{\ensuremath{\sigma}}_{{n}_{B}}]$ with $\ensuremath{\xi}⪡1$ 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.

arXiv:quant-ph/0410170•Physical Review A•Mar 18, 2005•37 citations

Maximal entanglement in quantum computation

Alba Cervera-Lierta

Book of Abstracts Student Research•May 7, 2019•0 citations

Quantum gates and entanglement

Schmidt-Kaler, Haffiier, Riebe +7 more

Conference on Lasers and Electro-Optics•Jan 1, 2004•0 citations
We develop the probabilistic implementation of a nonlocal gate $\mathrm{exp}[i\ensuremath{\xi}{\ensuremath{\sigma}}_{{n}_{A}}{\ensuremath{\sigma}}_{{n}_{B}}]$ and $\ensuremath{\xi}∊[0,(\ensuremath{\pi}∕4)]$, by using a single nonmaximally entangled state. We prove that nonlocal gates can be implemented with a fidelity of >79.3>79.3%>79.3 and a consumption of <0.969ebits<0.969\phantom{\rule{0.3em}{0ex}}\mathrm{ebits}<0.969ebits and two classical bits, when $\ensuremath{\xi}\ensuremath{\leqslant}0.353$. This provides a higher bound for the feasible operation compared to the former techniques. Besides, gates with $\ensuremath{\xi}\ensuremath{\geqslant}0.353$ can be implemented with the probability 79.3% and a consumption of 0.969 ebits, which is the same efficiency as the distillation-based protocol, while our method saves extra classical resources. Gates with $\ensuremath{\xi}\ensuremath{\rightarrow}0$ can be implemented with nearly unit probability and a small entanglement. We also generalize some applications to the multiple system, where we find it is possible to implement certain nonlocal gates between many nonentangled partners using a nonmaximally multiple entangled state.
We propose and study a method for using nonmaximally entangled states to probabilistically implement desired nonlocal gates. Unlike distillation-based protocols, this method does not generate a maximally entangled state at intermediate stages of the process. As a consequence, the method becomes more efficient at a certain range of parameters. Gates of the form $\mathrm{exp}[i\ensuremath{\xi}{\ensuremath{\sigma}}_{{n}_{A}}{\ensuremath{\sigma}}_{{n}_{B}}]$ with $\ensuremath{\xi}⪡1$ 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.