Performance of planar Floquet codes with Majorana-based qubits

• URL: http://arxiv.org/abs/2202.11829v2
• Date: Mon, 10 Oct 2022 17:46:11 GMT
• Title: Performance of planar Floquet codes with Majorana-based qubits
• Authors: Adam Paetznick, Christina Knapp, Nicolas Delfosse, Bela Bauer, Jeongwan Haah, Matthew B. Hastings, Marcus P. da Silva
• Abstract summary: Floquet codes are designed to be constructed entirely from two-qubit measurements. This makes them suitable for platforms where two-qubit measurements can be implemented directly. In particular, we show that they improve the threshold for scalable quantum computation in MZM-based systems by an order of magnitude.
• Score: 0.18472148461613155
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction is crucial for any quantum computing platform to achieve truly scalable quantum computation. The surface code and its variants have been considered the most promising quantum error correction scheme due to their high threshold, low overhead, and relatively simple structure that can naturally be implemented in many existing qubit architectures, such as superconducting qubits. The recent development of Floquet codes offers another promising approach. By going beyond the usual paradigm of stabilizer codes, Floquet codes achieve similar performance while being constructed entirely from two-qubit measurements. This makes them particularly suitable for platforms where two-qubit measurements can be implemented directly, such as measurement-only topological qubits based on Majorana zero modes (MZMs). Here, we explain how two variants of Floquet codes can be implemented on MZM-based architectures without any auxiliary qubits for syndrome measurement and with shallow syndrome extraction sequences. We then numerically demonstrate their favorable performance. In particular, we show that they improve the threshold for scalable quantum computation in MZM-based systems by an order of magnitude, and significantly reduce space and time overheads below threshold.

Related papers

• Estimating quantum amplitudes can be exponentially improved [11.282486674587236]
  Estimating quantum amplitudes is a fundamental task in quantum computing. We present a novel framework for estimating quantum amplitudes by transforming pure states into their matrix forms. Our framework achieves the standard quantum limit $epsilon-2$ and the Heisenberg limit $epsilon-1$, respectively.
  arXiv  Detail & Related papers  (2024-08-25T04:35:53Z)
• Modular Architectures and Entanglement Schemes for Error-Corrected Distributed Quantum Computation [1.6492989697868894]
  We study modular quantum computers with solid-state quantum hardware. We investigate a distributed surface code's error-correcting threshold and logical failure rate. We find that the performance of the code depends significantly on the choice of entanglement generation scheme.
  arXiv  Detail & Related papers  (2024-08-05T21:20:03Z)
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
  Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing. In this paper, we show that such constrained architectures can also support fault tolerance. We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
  arXiv  Detail & Related papers  (2024-02-19T23:31:55Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• An Optimized Quantum Implementation of ISD on Scalable Quantum Resources [2.274915755738124]
  We show that Prange's ISD algorithm can be implemented rather efficiently on a quantum computer. We leverage the idea of classical co-processors to design hybrid classical-quantum trade-offs.
  arXiv  Detail & Related papers  (2021-12-12T06:01:10Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Improved Quantum State Tomography for the Systems with XX+YY Couplings and Z Readouts [0.20305676256390928]
  I propose an improved quantum state tomography (QST) using 2-qubit evolutions as the readout operations. I respectively apply the new scheme on SQC systems with the Nearest-Neighbor, 2-Dimensional, and All-to-All connectivities on qubits. It is found that, the new scheme has good implementability and it can achieve comparable or even better accuracy than the traditional scheme.
  arXiv  Detail & Related papers  (2020-06-29T08:48:55Z)
• Scalable quantum processor noise characterization [57.57666052437813]
  We present a scalable way to construct approximate MFMs for many-qubit devices based on cumulant expansion. Our method can also be used to characterize various types of correlation error.
  arXiv  Detail & Related papers  (2020-06-02T17:39:42Z)

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.