中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Scalable algorithm simplification using quantum AND logic

文献类型:期刊论文

作者Chu, Ji5,6,7; He, Xiaoyu3,4; Zhou, Yuxuan2,5,6,7; Yuan, Jiahao2,5,6,7; Zhang, Libo5,6,7; Guo, Qihao5,6,7; Hai, Yongju5,6,7; Han, Zhikun5,6,7; Hu, Chang-Kang5,6,7; Huang, Wenhui2,5,6,7
刊名NATURE PHYSICS
出版日期2022-11-14
页码7
ISSN号1745-2473
DOI10.1038/s41567-022-01813-7
英文摘要Implementing quantum algorithms on realistic devices requires translating high-level global operations into sequences of hardware-native logic gates, a process known as quantum compiling. Physical limitations, such as constraints in connectivity and gate alphabets, often result in unacceptable implementation costs. To enable successful near-term applications, it is crucial to optimize compilation by exploiting the capabilities of existing hardware. Here we implement a resource-efficient construction for a quantum version of AND logic that can reduce the compilation overhead, enabling the execution of key quantum circuits. On a high-scalability superconducting quantum processor, we demonstrate low-depth synthesis of high-fidelity generalized Toffoli gates with up to 8 qubits and Grover's search algorithm in a search space of up to 64 entries. Our experimental demonstration illustrates a scalable and widely applicable approach to implementing quantum algorithms, bringing more meaningful quantum applications on noisy devices within reach. To run algorithms on a computer they are broken down into logical operations that are implemented in hardware. A quantum logical AND gate has now been demonstrated, which could substantially improve the efficiency of near-term quantum computers.
资助项目Key-Area Research and Development Program of GuangDong Province[2018B030326001] ; National Natural Science Foundation of China[U1801661] ; National Natural Science Foundation of China[61832003] ; Guangdong Innovative and Entrepreneurial Research Team Program[2016ZT06D348] ; Guangdong Provincial Key Laboratory[2019B121203002] ; Natural Science Foundation of Guangdong Province[2017B030308003] ; Science, Technology and Innovation Commission of Shenzhen Municipality[KYTDPT20181011104202253] ; Shenzhen-Hong Kong Cooperation Zone for Technology and Innovation[HZQB-KCZYB-2020050] ; NSF of Beijing[Z190012] ; Strategic Priority Research Program of Chinese Academy of Sciences[XDB28000000]
WOS研究方向Physics
语种英语
出版者NATURE PORTFOLIO
WOS记录号WOS:000883265700003
源URL[http://119.78.100.204/handle/2XEOYT63/19901]  
专题中国科学院计算技术研究所期刊论文
通讯作者Yan, Fei; Sun, Xiaoming; Yu, Dapeng
作者单位1.Univ Chinese Acad Sci, CAS Ctr Excellence Topol Quantum Computat, Beijing, Peoples R China
2.Southern Univ Sci & Technol, Dept Phys, Shenzhen, Peoples R China
3.Univ Chinese Acad Sci, Beijing, Peoples R China
4.Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
5.Southern Univ Sci & Technol, Guangdong Prov Key Lab Quantum Sci & Engn, Shenzhen, Guangdong, Peoples R China
6.Int Quantum Acad, Shenzhen, Guangdong, Peoples R China
7.Southern Univ Sci & Technol, Shenzhen Inst Quantum Sci & Engn, Shenzhen, Guangdong, Peoples R China
推荐引用方式
GB/T 7714
Chu, Ji,He, Xiaoyu,Zhou, Yuxuan,et al. Scalable algorithm simplification using quantum AND logic[J]. NATURE PHYSICS,2022:7.
APA Chu, Ji.,He, Xiaoyu.,Zhou, Yuxuan.,Yuan, Jiahao.,Zhang, Libo.,...&Yu, Dapeng.(2022).Scalable algorithm simplification using quantum AND logic.NATURE PHYSICS,7.
MLA Chu, Ji,et al."Scalable algorithm simplification using quantum AND logic".NATURE PHYSICS (2022):7.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。