2025/03/17 by Zhong, Jiayi, Yuxin Deng, Deng, Yuxin
Computer Science · Engineering · #FOS: Physical sciences #Low-power high-performance VLSI design #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2503.13204
openalex publication_date 2025/03/17 · openalex created_date 2025/10/17 · openalex updated_date 2026/07/28
ZZ crosstalk and decoherence hinder superconducting quantum computing. To enhance parallelism in mitigating ZZ crosstalk, we formulate the problem by integrating quantum cycles and two forms of qubit interference. We then propose CYCO, a CYcle-aware ZZ Crosstalk Optimization algorithm, which uses a timing-based greedy strategy to schedule gates through cycles within quantum circuits. A novel data structure called Time and Distance Dependency Graph is designed to model gate data dependencies and physical distances from quantum topologies for precise scheduling. Additionally, dynamically punching barriers reduces idle time in quantum circuits, further enhancing parallelism. Simulations show a reduction of up to 37.44% in quantum program cycle (14.19% on average) on various NISQ devices with 53 to 127 qubits. Real-device experiments on IBMQ-Brisbane demonstrate significant acceleration in quantum computing while maintaining fidelity.