Error Rates and Resource Overheads of Repetition Cat Qubits

• URL: http://arxiv.org/abs/2009.10756v2
• Date: Wed, 31 Mar 2021 13:32:28 GMT
• Title: Error Rates and Resource Overheads of Repetition Cat Qubits
• Authors: J\'er\'emie Guillaud and Mazyar Mirrahimi
• Abstract summary: We analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation. Using only bias-preserving gates on the cat-qubits, it is possible to build a universal set of fault-tolerant logical gates.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We estimate and analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation. The cat qubits stabilized by two-photon dissipation exhibit an extremely biased noise where the bit-flip error rate is exponentially suppressed with the mean number of photons. In a recent work, we suggested that the remaining phase-flip error channel could be suppressed using a 1D repetition code. Indeed, using only bias-preserving gates on the cat-qubits, it is possible to build a universal set of fault-tolerant logical gates at the level of the repetition cat qubit. In this paper, we perform Monte-Carlo simulations of all the circuits implementing the protected logical gates, using a circuit-level error model. Furthermore, we analyze two different approaches to implement a fault-tolerant Toffoli gate on repetition cat qubits. These numerical simulations indicate that very low logical error rates could be achieved with a reasonable resource overhead, and with parameters that are within the reach of near-term circuit QED experiments.

Related papers

• Low bit-flip rate probabilistic error cancellation [0.0]
  Noise remains one of the most significant challenges in the development of reliable and scalable quantum processors. In this work, we explore how the unique noise bias of cat-qubits can be harnessed to enhance error mitigation efficiency.
  arXiv  Detail & Related papers  (2024-11-10T11:04:16Z)
• Performance Analysis of a Repetition Cat Code Architecture: Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126133 Cat Qubits [0.0]
  Cat qubits provide appealing building blocks for quantum computing. We quantify the cost of a repetition code and provide valuable guidance for the choice of a large scale architecture using cat qubits.
  arXiv  Detail & Related papers  (2023-02-13T19:01:05Z)
• High-performance repetition cat code using fast noisy operations [0.0]
  Cat qubits stabilized by two-photon driven dissipation benefit from exponential suppression of bit-flip errors and an extensive set of gates preserving this protection. We propose a performance optimization of the repetition cat code architecture using fast but noisy CNOT gates for stabilizer measurements.
  arXiv  Detail & Related papers  (2022-12-22T18:03:37Z)
• Overcoming leakage in scalable quantum error correction [128.39402546769284]
  Leakage of quantum information out of computational states into higher energy states represents a major challenge in the pursuit of quantum error correction (QEC) Here, we demonstrate the execution of a distance-3 surface code and distance-21 bit-flip code on a Sycamore quantum processor where leakage is removed from all qubits in each cycle. We report a ten-fold reduction in steady-state leakage population on the data qubits encoding the logical state and an average leakage population of less than $1 times 10-3$ throughout the entire device.
  arXiv  Detail & Related papers  (2022-11-09T07:54:35Z)
• Quantum error correction with dissipatively stabilized squeezed cat qubits [68.8204255655161]
  We propose and analyze the error correction performance of a dissipatively stabilized squeezed cat qubit. We find that for moderate squeezing the bit-flip error rate gets significantly reduced in comparison with the ordinary cat qubit while leaving the phase flip rate unchanged.
  arXiv  Detail & Related papers  (2022-10-24T16:02:20Z)
• Construction of Bias-preserving Operations for Pair-cat Code [17.34207569961146]
  Multi-level systems can achieve a desirable set of bias-preserving quantum operations. Cat codes are not compatible with continuous quantum error correction against excitation loss error. We generalize the bias-preserving operations to pair-cat codes to be compatible with continuous quantum error correction against both bosonic loss and dephasing errors.
  arXiv  Detail & Related papers  (2022-08-14T20:45:26Z)
• 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)
• Fault-tolerant multiqubit geometric entangling gates using photonic cat-state qubits [0.8024702830680637]
  We propose a theoretical protocol to implement multiqubit geometric gates using photonic cat-state qubits. These cat-state qubits are promising for hardware-efficient universal quantum computing.
  arXiv  Detail & Related papers  (2021-09-10T03:04:32Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
  bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
  arXiv  Detail & Related papers  (2021-05-28T15:20:21Z)
• Learning Frequency Domain Approximation for Binary Neural Networks [68.79904499480025]
  We propose to estimate the gradient of sign function in the Fourier frequency domain using the combination of sine functions for training BNNs. The experiments on several benchmark datasets and neural architectures illustrate that the binary network learned using our method achieves the state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2021-03-01T08:25:26Z)

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.