Scalable algorithm simplification using quantum AND logic

• DOI: 10.1038/s41567-022-01813-7
• Publication Date: 2022-11-14T17:03:23Z
• Authors: Ji Chu; Xiaoyu He; Yuxuan Zhou; Jiahao Yuan; Libo Zhang; Qihao Guo; Yongju Hai; Zhikun Han; Chang-Kang Hu; Wenhui Huang; Hao Jia; Dawei Jiao; Sai Li; Yang Liu; Zhongchu Ni; Lifu Nie; Xianchuang Pan; Jiawei Qiu; Weiwei Wei; Wuerkaixi Nuerbolati; Zusheng Yang; Jiajian Zhang; Zhida Zhang; Wanjing Zou; Yuanzhen Chen; Xiaowei Deng; Xiuhao Deng; Ling Hu; Jian Li; Song Liu; Yao Lu; Jingjing Niu; Dian Tan; Yuan Xu; Tongxing Yan; Youpeng Zhong; Fei Yan; Xiaoming Sun; Dapeng Yu
• Keywords: Quantum Physics; 0103 physical sciences; FOS: Physical sciences; Quantum Physics (quant-ph); 01 natural sciences

AbstractImplementing 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.