检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:WANG Feng LUO MingXing CHEN XiuBo YANG YiXian WANG XiaoJun
机构地区:[1]College of mathematical sciences, Dezhou University [2]Information Security and National Computing Grid Laboratory, Southwest Jiaotong University [3]State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences [4]Information Security Center, State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications [5]School of Electronic Engineering, Dublin City University
出 处:《Science China(Physics,Mechanics & Astronomy)》2014年第10期1913-1917,共5页中国科学:物理学、力学、天文学(英文版)
基 金:supported by the National Natural Science Foundation of China(Grant Nos.61303039,61272514,61003287,61170272,61121061 and 61161140320);the Fundamental Research Funds for the Central Universities(Grant No.2682014CX095);New Century Excellent Talents in University(Grant No.NCET-13-0681);the National Development Foundation-for Cryptological Research(Grant No.MMJJ201401012);the Fok Ying Tong Education Foundation(Grant No.131067);the Science Foundation Ireland under the International Strategic Cooperation Award(Grant No.SFI/12/ISCA/2496)
摘 要: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.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.
关 键 词:universal bipartite entangler random unitary gate ENTANGLEMENT
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229