Scalable algorithm simplification using quantum AND logic
Abstract
Implementing quantum algorithms on realistic hardware requires translating high-level global operations into sequences of native elementary 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 potential capabilities of existing hardware. Here, we implement a resource-efficient construction for a quantum version of AND logic that can reduce the cost, 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; both are the largest such implementations in scale to date. Our experimental demonstration illustrates a scalable implementation of simplifying quantum algorithms, paving the way for larger, more meaningful quantum applications on noisy devices.
Cite
@article{arxiv.2112.14922,
title = {Scalable algorithm simplification using quantum AND logic},
author = {Ji Chu and Xiaoyu He and Yuxuan Zhou and Jiahao Yuan and Libo Zhang and Qihao Guo and Yongju Hai and Zhikun Han and Chang-Kang Hu and Wenhui Huang and Hao Jia and Dawei Jiao and Yang Liu and Zhongchu Ni and Xianchuang Pan and Jiawei Qiu and Weiwei Wei and Zusheng Yang and Jiajian Zhang and Zhida Zhang and Wanjing Zou and Yuanzhen Chen and Xiaowei Deng and Xiuhao Deng and Ling Hu and Jian Li and Dian Tan and Yuan Xu and Tongxing Yan and Xiaoming Sun and Fei Yan and Dapeng Yu},
journal= {arXiv preprint arXiv:2112.14922},
year = {2023}
}