Parallel Driving for Fast Quantum Computing Under Speed Limits

• URL: http://arxiv.org/abs/2302.01252v2
• Date: Fri, 3 Feb 2023 01:52:09 GMT
• Title: Parallel Driving for Fast Quantum Computing Under Speed Limits
• Authors: Evan McKinney, Chao Zhou, Mingkang Xia, Michael Hatridge, Alex K. Jones
• Abstract summary: The choice of a two-qubit (2Q) hardware basis gate depends on a quantum modulator's native Hamiltonian interactions and applied control drives. We propose a parallel-drive approach that drives the modulator and qubits simultaneously. This allows increasingly short duration 2Q gates while mitigating a significant source of overhead in some quantum systems.
• Score: 2.5919949228116343
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Increasing quantum circuit fidelity requires an efficient instruction set to avoid errors from decoherence. The choice of a two-qubit (2Q) hardware basis gate depends on a quantum modulator's native Hamiltonian interactions and applied control drives. In this paper, we propose a collaborative design approach to select the best ratio of drive parameters that determine the best basis gate for a particular modulator. This requires considering the theoretical computing power of the gate along with the practical speed limit of that gate, given the modulator drive parameters. The practical speed limit arises from the couplers' tolerance for strong driving when one or more pumps is applied, for which some combinations can result in higher overall speed limits than others. Moreover, as this 2Q basis gate is typically applied multiple times in succession, interleaved by 1Q gates applied directly to the qubits, the speed of the 1Q gates can become a limiting factor for the quantum circuit. We propose a parallel-drive approach that drives the modulator and qubits simultaneously, allowing a richer capability of the 2Q basis gate and in some cases for this 1Q drive time to be absorbed entirely into the 2Q operation. This allows increasingly short duration 2Q gates while mitigating a significant source of overhead in some quantum systems. On average, this approach can decrease circuit duration by 17.84% and decrease infidelity for random 2Q gates by 10.5% compared to the best basic 2Q gate, $\sqrt{\texttt{iSWAP}}$.

Related papers

• A two-circuit approach to reducing quantum resources for the quantum lattice Boltzmann method [41.66129197681683]
  Current quantum algorithms for solving CFD problems use a single quantum circuit and, in some cases, lattice-based methods. We introduce the a novel multiple circuits algorithm that makes use of a quantum lattice Boltzmann method (QLBM) The problem is cast as a stream function--vorticity formulation of the 2D Navier-Stokes equations and verified and tested on a 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• 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)
• Speed limits of two-qubit gates with qudits [0.5852077003870417]
  We find an optimal theoretical bound for the speed limit of a two-qubit gate achieved using two qudits with a bounded interaction strength and arbitrarily fast single-qudit gates. We develop an open-source, machine learning assisted, quantum optimal control algorithm that can achieve a speedup close to the theoretical limit with near-perfect gate fidelity.
  arXiv  Detail & Related papers  (2023-12-14T18:49:11Z)
• 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)
• BQA: A High-performance Quantum Circuits Scheduling Strategy Based on Heuristic Search [6.765549459416703]
  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.
  arXiv  Detail & Related papers  (2022-09-08T02:49:51Z)
• Let Each Quantum Bit Choose Its Basis Gates [3.6690675649846396]
  Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits) In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits. This work aims to give quantum scientists the ability to run meaningful algorithms with qubit systems that are not perfectly uniform.
  arXiv  Detail & Related papers  (2022-08-29T05:55:55Z)
• Implementing two-qubit gates at the quantum speed limit [33.51056531486263]
  We experimentally demonstrate commonly used two-qubit gates at nearly the fastest possible speed. We achieve this quantum speed limit by implementing experimental gates designed using a machine learning inspired optimal control method. We expect our method to offer significant speedups for non-native two-qubit gates.
  arXiv  Detail & Related papers  (2022-06-15T18:00:00Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Quantum control landscape for ultrafast generation of single-qubit phase shift quantum gates [68.8204255655161]
  We consider the problem of ultrafast controlled generation of single-qubit phase shift quantum gates. Globally optimal control is a control which realizes the gate with maximal possible fidelity. Trap is a control which is optimal only locally but not globally.
  arXiv  Detail & Related papers  (2021-04-26T16:38:43Z)
• Benchmarking the noise sensitivity of different parametric two-qubit gates in a single superconducting quantum computing platform [0.0]
  A larger hardware-native gate set may decrease the number of required gates, provided that all gates are realized with high fidelity. We benchmark both controlled-Z (CZ) and exchange-type (iSWAP) gates using a parametrically driven tunable coupler. We argue that spurious $ZZ$-type couplings are the dominant error source for the iSWAP gate.
  arXiv  Detail & Related papers  (2020-05-12T11:38:41Z)
• 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.