Scalable algorithm simplification using quantum AND logic
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,, Yang Liu, Zhongchu Ni, Xianchuang Pan, Jiawei Qiu, Weiwei Wei, Zusheng Yang,, Jiajian Zhang, Zhida Zhang, Wanjing Zou, Yuanzhen Chen

TL;DR
This paper presents a scalable quantum AND logic implementation that reduces resource costs, enabling efficient execution of complex quantum circuits like generalized Toffoli gates and Grover's algorithm on superconducting hardware.
Contribution
The authors develop a resource-efficient quantum AND logic construction and demonstrate its application to large-scale quantum circuits on a superconducting processor.
Findings
Successful synthesis of high-fidelity generalized Toffoli gates with up to 8 qubits
Implementation of Grover's search algorithm for 64 entries
Largest such quantum implementations to date
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
