CAMEL: Physically Inspired Crosstalk-Aware Mapping and gatE Scheduling for Frequency-Tunable Quantum Chips

• URL: http://arxiv.org/abs/2311.18160v2
• Date: Tue, 16 Apr 2024 09:04:29 GMT
• Title: CAMEL: Physically Inspired Crosstalk-Aware Mapping and gatE Scheduling for Frequency-Tunable Quantum Chips
• Authors: Bin-han Lu, Peng Wang, Zhao-yun Chen, Huan-yu Liu, Tai-ping Sun, Peng Duan, Yu-chun Wu, Guo-ping Guo,
• Abstract summary: Crosstalk represents a formidable obstacle in quantum computing. We introduce a Crosstalk-Aware Mapping and gatE Scheduling (CAMEL) approach to mitigate crosstalk. In contrast to approaches serializing crosstalk gates, CAMEL successfully suppresses decoherence.
• Score: 5.882878136245986
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Crosstalk represents a formidable obstacle in quantum computing. When quantum gates are executed parallelly, the resonance of qubit frequencies can lead to residual coupling, compromising the fidelity. Existing crosstalk solutions encounter difficulties in mitigating crosstalk and decoherence when dealing with parallel two-qubit gates in frequency-tunable quantum chips. Inspired by the physical properties of frequency-tunable quantum chips, we introduce a Crosstalk-Aware Mapping and gatE Scheduling (CAMEL) approach to address these challenges. CAMEL aims to mitigate crosstalk of parallel two-qubit gates and suppress decoherence. Utilizing the features of the tunable coupler, the CAMEL approach integrates a pulse compensation method for crosstalk mitigation. Furthermore, we present a compilation framework, including two steps. Firstly, we devise a qubit mapping approach that accounts for both crosstalk and decoherence. Secondly, we introduce a gate timing scheduling approach capable of prioritizing the execution of the largest set of crosstalk-free parallel gates to shorten quantum circuit execution times. Evaluation results demonstrate the effectiveness of CAMEL in mitigating crosstalk compared to crosstalk-agnostic methods. Furthermore, in contrast to approaches serializing crosstalk gates, CAMEL successfully suppresses decoherence. Finally, CAMEL exhibits better performance over dynamic-frequency awareness in low-complexity hardware.

Related papers

• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Mitigation of quantum crosstalk in cross-resonance based qubit architectures [8.23558342809427]
  We introduce a CR gate-based transmon architecture with passive mitigation of both quantum crosstalk and frequency collisions. We show that ZZ crosstalk can be suppressed while maintaining XY couplings to support fast, high-fidelity CR gates. This work could be useful for suppressing quantum crosstalk and improving gate fidelities in large-scale quantum processors.
  arXiv  Detail & Related papers  (2023-07-19T13:59:10Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• A Synergistic Compilation Workflow for Tackling Crosstalk in Quantum Machines [17.37662149918109]
  Crosstalk noise has been recognized as one of several major types of noises in superconducting Noisy Intermediate-Scale Quantum (NISQ) devices. We propose a crosstalk-aware quantum program compilation framework called CQC that can enhance crosstalk mitigation while achieving satisfactory circuit depth. Our framework can significantly reduce the error rate by up to 6$times$, with only $sim$60% circuit depth compared to state-of-the-art gate scheduling approaches.
  arXiv  Detail & Related papers  (2022-07-12T04:11:05Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits [12.776712619117092]
  We study the impact of quantum crosstalk on simultaneous gate operations in a qubit architecture. Our analysis shows that for microwave-driven single-qubit gates, the dressing from the qubit-qubit coupling can cause non-negligible cross-driving errors.
  arXiv  Detail & Related papers  (2021-10-25T01:21:04Z)
• Analyzing crosstalk error in the NISQ era [0.0]
  NISQ hardware has unavoidable noises, and crosstalk error is a significant error source. In this work, we first report on several protocols for characterizing crosstalk. Then, we discuss different crosstalk mitigation methods from the hardware and software perspectives.
  arXiv  Detail & Related papers  (2021-06-03T08:20:40Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation [3.2460743209388094]
  One of the key challenges in current Noisy Intermediate-Scale Quantum (NISQ) computers is to control a quantum system with high-fidelity quantum gates. We motivate a systematic approach for understanding and mitigating the crosstalk noise when executing near-term quantum programs on superconducting NISQ computers. We present a general software solution to alleviate frequency crowding by systematically tuning qubit frequencies according to input programs.
  arXiv  Detail & Related papers  (2020-08-21T14:35:38Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.