Comparing Two-Qubit and Multi-Qubit Gates within the Toric Code

• URL: http://arxiv.org/abs/2111.04047v2
• Date: Thu, 17 Feb 2022 15:34:08 GMT
• Title: Comparing Two-Qubit and Multi-Qubit Gates within the Toric Code
• Authors: David Schwerdt, Yotam Shapira, Tom Manovitz, and Roee Ozeri
• Abstract summary: We show that a five-qubit Molmer-Sorensen gate offers an approximately $40%$ improvement over two-qubit gates in terms of the fault tolerance threshold. This result indicates an advantage of using multi-qubit gates in the context of quantum error correction (QEC)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In some quantum computing (QC) architectures, entanglement of an arbitrary number of qubits can be generated in a single operation. This property has many potential applications, and may specifically be useful for quantum error correction (QEC). Stabilizer measurements can then be implemented using a single multi-qubit gate instead of several two-qubit gates, thus reducing circuit depth. In this study, the toric code is used as a benchmark to compare the performance of two-qubit and five-qubit gates within parity-check circuits. We consider trapped ion qubits that are controlled via Raman transitions, where the primary source of error is assumed to be spontaneous photon scattering. We show that a five-qubit M{\o}lmer-S{\o}rensen gate offers an approximately $40\%$ improvement over two-qubit gates in terms of the fault tolerance threshold. This result indicates an advantage of using multi-qubit gates in the context of QEC.

Related papers

• Quantum circuit synthesis via a random combinatorial search [0.0]
  We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. We show that the fraction of perfect-fidelity quantum circuits increases rapidly as soon as the circuit size exceeds the minimum circuit size required for achieving unit fidelity.
  arXiv  Detail & Related papers  (2023-11-29T00:59:29Z)
• Two qubits in one transmon -- QEC without ancilla hardware [68.8204255655161]
  We show that it is theoretically possible to use higher energy levels for storing and controlling two qubits within a superconducting transmon. The additional qubits could be used in algorithms which need many short-living qubits in error correction or by embedding effecitve higher connectivity in qubit networks.
  arXiv  Detail & Related papers  (2023-02-28T16:18:00Z)
• Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls [62.997667081978825]
  We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
  arXiv  Detail & Related papers  (2022-12-09T12:59:44Z)
• 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)
• Calibration of Drive Non-Linearity for Arbitrary-Angle Single-Qubit Gates Using Error Amplification [43.97138136532209]
  Non-linearity of qubit drive line components imposes a limit on the fidelity of single-qubit gates. We demonstrate arbitrary-angle single-qubit gates with coherence-limited errors of $2times 10-4$ and leakage below $6times 10-5$.
  arXiv  Detail & Related papers  (2022-12-02T10:34:43Z)
• Controlled Gate Networks Applied to Eigenvalue Estimation [0.28106259549258145]
  We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates.
  arXiv  Detail & Related papers  (2022-08-29T12:46:46Z)
• 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)
• Error-divisible two-qubit gates [0.0]
  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.
  arXiv  Detail & Related papers  (2021-10-22T00:42:17Z)
• 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)
• 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.