Optimization of CNOT circuits on limited connectivity architecture
Bujiao Wu, Xiaoyu He, Shuai Yang, Lifu Shou, Guojing Tian, Jialin, Zhang, Xiaoming Sun

TL;DR
This paper develops optimization methods for CNOT circuits tailored to limited connectivity quantum architectures, achieving reduced size and depth, and demonstrating improved robustness and performance on real devices.
Contribution
The paper introduces new algorithms for optimizing CNOT circuits on limited connectivity architectures, with proven bounds and practical improvements over existing methods.
Findings
Optimized CNOT circuit size to O(n^2 / log δ) on connected graphs with minimum degree δ.
Achieved circuit size below 2n^2 for sparsely connected structures.
Experimental results show improved robustness and performance on IBMQ devices.
Abstract
A CNOT circuit is the key gadget for entangling qubits in quantum computing systems. However, the qubit connectivity of noisy intermediate-scale quantum (NISQ) devices is constrained by their {limited connectivity architecture}. To improve the performance of CNOT circuits on NISQ devices, we investigate the optimization of the size/depth of CNOT circuits under the limited connectivity architecture. We present a method that can optimize the size of any -qubit CNOT circuit on any connected graph with minimum degree , and prove this bound is optimal for the regular graph. For the near-term sparsely connected structure, we additionally present a method that can optimize the size of any -qubit CNOT circuit to below . The numerical experiment shows that our method performs better than state-of-the-art results. Specifically, we…
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.
