Saved in:
Bibliographic Details
Main Authors: Zhong, Jiayi, Deng, Yuxin
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2503.13204
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910885338939392
author Zhong, Jiayi
Deng, Yuxin
author_facet Zhong, Jiayi
Deng, Yuxin
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2503_13204
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Cycle-Aware ZZ Crosstalk Mitigation on Quantum Hardware
Zhong, Jiayi
Deng, Yuxin
Quantum Physics
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.
title Cycle-Aware ZZ Crosstalk Mitigation on Quantum Hardware
topic Quantum Physics
url https://arxiv.org/abs/2503.13204