Error-divisible two-qubit gates

• URL: http://arxiv.org/abs/2110.11537v1
• Date: Fri, 22 Oct 2021 00:42:17 GMT
• Title: Error-divisible two-qubit gates
• Authors: David Rodriguez Perez, Paul Varosy, Ziqian Li, Tanay Roy, Eliot Kapit, David Schuster
• Abstract summary: We introduce a simple, widely applicable formalism for designing "error-divisible" two qubit gates. This work introduces a set of criteria, and example waveforms and protocols to satisfy them. If implemented at scale, NISQ algorithm performance would be significantly improved by our error-divisible gate protocols.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a simple, widely applicable formalism for designing "error-divisible" two qubit gates: a quantum gate set where fractional rotations have proportionally reduced error compared to the full entangling gate. In current noisy intermediate-scale quantum (NISQ) algorithms, performance is largely constrained by error proliferation at high circuit depths, of which two-qubit gate error is generally the dominant contribution. Further, in many hardware implementations, arbitrary two qubit rotations must be composed from multiple two-qubit stock gates, further increasing error. This work introduces a set of criteria, and example waveforms and protocols to satisfy them, using superconducting qubits with tunable couplers for constructing continuous gate sets with significantly reduced error for small-angle rotations. If implemented at scale, NISQ algorithm performance would be significantly improved by our error-divisible gate protocols.

Related papers

• A diverse set of two-qubit gates for spin qubits in semiconductor quantum dots [5.228819198411081]
  We propose and verify a fast composite two-qubit gate scheme to extend the available two-qubit gate types. Our gate scheme limits the parameter requirements of all essential two-qubit gates to a common JDeltaE_Z region. With this versatile composite gate scheme, broad-spectrum two-qubit operations allow us to efficiently utilize the hardware and the underlying physics resources.
  arXiv  Detail & Related papers  (2024-04-29T13:37:43Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [44.99833362998488]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers. The square-lattice surface code has become the workhorse to address this challenge. In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• 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)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• 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)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• 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)
• High-fidelity, high-scalability two-qubit gate scheme for superconducting qubits [16.01171409402694]
  We experimentally demonstrate a new two-qubit gate scheme that exploits fixed-frequency qubits and a tunable coupler in a superconducting quantum circuit. The scheme requires less control lines, reduces crosstalk effect, simplifies calibration procedures, yet produces a controlled-Z gate in 30ns with a high fidelity of 99.5%. Our demonstration paves the way for large-scale implementation of high-fidelity quantum operations.
  arXiv  Detail & Related papers  (2020-06-21T17:55: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.