|
|||||
|
|
Typical universal entanglers |
|
| Authors: | Feng Wang MingXing Luo XiuBo Chen YiXian Yang XiaoJun Wang |
| Affiliation: | 1. College of mathematical sciences, Dezhou University, Dezhou, 253023, China 2. Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu, 610031, China 3. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China 4. Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China 5. School of Electronic Engineering, Dublin City University, Dublin 9, Ireland |
| Abstract: | A universal entangler is a very powerful fault-tolerant entangling device for generating quantum entanglements from any joint states. Our paper aims to address the construction of universal entanglers. We prove that universal entanglers may be obtained from random unitary gates according to the Harr measure. The success probability is close to 1 for large system spaces. This result represents the typical density of entanglement subspaces in large state spaces. It also partially solves an open problem of universal bipartite entanglers and is explained by some experiment simulations. |
| Keywords: | universal bipartite entangler random unitary gate entanglement |
| 本文献已被 CNKI SpringerLink 等数据库收录！ | |