BQA: A High-performance Quantum Circuits Scheduling Strategy Based on Heuristic Search

• URL: http://arxiv.org/abs/2209.03542v1
• Date: Thu, 8 Sep 2022 02:49:51 GMT
• Title: BQA: A High-performance Quantum Circuits Scheduling Strategy Based on Heuristic Search
• Authors: Xin-miao Chen and Shi Wang and Yong-jin Ye and Bo Jiang and Yong-zheng Wu
• Abstract summary: It is necessary to ensure that the two-qubit gate acts on a pair of coupled qubits by inserting swap gates. In this paper, we designed a way based on the business to insert swap gates BQA(Busy Qubits Avoid) Compared with qiskit, the execution time of the circuit optimized by our proposed method is only 0.5 times that of the qiskit compiled circuit.
• Score: 6.765549459416703
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Currently, quantum computing is developing at a high speed because its high parallelism and high computing power bring new solutions to many fields. However, due to chip process technology, it is difficult to achieve full coupling of all qubits on a quantum chip, so when compiling a quantum circuit onto a physical chip, it is necessary to ensure that the two-qubit gate acts on a pair of coupled qubits by inserting swap gates. It will cause great additional cost when a large number of swap gates are inserted, leading to the execution time of quantum circuits longer. In this paper, we designed a way based on the business to insert swap gates BQA(Busy Qubits Avoid). We exploit the imbalance of the number of gates on qubits, trying to hide the overhead of swap gates. At the same time, we also expect swap gates to make as little negative impact on subsequent two-qubit gates as possible. We have designed a heuristic function that can take into account both of these points. Compared with qiskit, the execution time of the circuit optimized by our proposed method is only 0.5 times that of the qiskit compiled circuit. And when the number of two-qubit gates is large, it will achieve higher level than general conditions. This implies higher execution efficiency and lower decoherence error rate.

Related papers

• 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)
• Improving fidelity of multi-qubit gates using hardware-level pulse parallelization [0.0]
  We present the parallelization of pre-calibrated pulses at the hardware level as an easy-to-implement strategy to optimize quantum gates. We show that such parallelization leads to improved fidelity and gate time reduction, when compared to serial concatenation.
  arXiv  Detail & Related papers  (2023-12-20T19:00:02Z)
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing [8.478982715648547]
  Scheme for qubits with $XX+YY$ coupling realizes any two-qubit gate up to single-qubit gates. We observe marked improvements across various applications, including generic $n$-qubit gate synthesis, quantum volume, and qubit routing.
  arXiv  Detail & Related papers  (2023-12-09T19:30:31Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Comparing planar quantum computing platforms at the quantum speed limit [0.0]
  We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL) for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. We analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping.
  arXiv  Detail & Related papers  (2023-04-04T12:47:00Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Fast multi-qubit gates through simultaneous two-qubit gates [0.5949967357689445]
  Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. One way to overcome these limitations is to expand the available gate set from single- and two-qubit gates to multi-qubit gates. We show that such multi-qubit gates can be realized by the simultaneous application of multiple two-qubit gates to a group of qubits.
  arXiv  Detail & Related papers  (2021-08-25T17:24:31Z)
• Efficient, stabilized two-qubit gates on a trapped-ion quantum computer [4.547776040126478]
  We present two methods to construct optimal pulses for entangling gates on a pair of ions within a trapped ion chain. We illustrate these trade-offs on a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2021-01-19T22:40:28Z)
• 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.