Modular Architectures and Entanglement Schemes for Error-Corrected Distributed Quantum Computation

• URL: http://arxiv.org/abs/2408.02837v1
• Date: Mon, 5 Aug 2024 21:20:03 GMT
• Title: Modular Architectures and Entanglement Schemes for Error-Corrected Distributed Quantum Computation
• Authors: Siddhant Singh, Fenglei Gu, Sébastian de Bone, Eduardo Villaseñor, David Elkouss, Johannes Borregaard,
• Abstract summary: 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.
• Score: 1.6492989697868894
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Connecting multiple smaller qubit modules by generating high-fidelity entangled states is a promising path for scaling quantum computing hardware. The performance of such a modular quantum computer is highly dependent on the quality and rate of entanglement generation. However, the optimal architectures and entanglement generation schemes are not yet established. Focusing on modular quantum computers with solid-state quantum hardware, we investigate a distributed surface code's error-correcting threshold and logical failure rate. We consider both emission-based and scattering-based entanglement generation schemes for the measurement of non-local stabilizers. Through quantum optical modeling, we link the performance of the quantum error correction code to the parameters of the underlying physical hardware and identify the necessary parameter regime for fault-tolerant modular quantum computation. In addition, we compare modular architectures with one or two data qubits per module. We find that the performance of the code depends significantly on the choice of entanglement generation scheme, while the two modular architectures have similar error-correcting thresholds. For some schemes, thresholds nearing the thresholds of non-distributed implementations ($\sim0.4 \%$) appear feasible with future parameters.

Related papers

• Towards Error Budgeting for Superconducting Modular Quantum Architecture Designs [2.3420045370973828]
  We present physics-informed design constraints by describing a physical model for realizable gates within a SNAIL module. We tackle the allocation problem by analyzing the impact of frequency crowding on gate fidelity as the radix of the module increases.
  arXiv  Detail & Related papers  (2024-09-26T20:15:45Z)
• Towards Distributed Quantum Error Correction for Distributed Quantum Computing [15.824983694947573]
  A new qubit-based Distributed Quantum Error Correction (DQEC) architecture is proposed in which three physical qubits residing on three Quantum Processing Units (QPU) are used to form a logical qubit. This paper illustrates how three QPUs collaboratively generate a joint quantum state in which single bit-flip and phase-flip errors can be properly resolved. The functional correctness of the proposed architecture is evaluated through the Qiskit tool and stabilizer generators.
  arXiv  Detail & Related papers  (2024-09-08T23:10:00Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• Variational Quantum Eigensolvers in the Era of Distributed Quantum Computers [0.0]
  We show that a distributed quantum computing architecture with it limited capacity to exchange information between modules can accurately solve quantum computational problems. Results provide a strong indication that near-term it modular quantum processors can be an effective alternative to their monolithic counterparts.
  arXiv  Detail & Related papers  (2023-02-27T19:00:01Z)
• 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)
• Performance of planar Floquet codes with Majorana-based qubits [0.18472148461613155]
  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.
  arXiv  Detail & Related papers  (2022-02-23T23:49:48Z)
• 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)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.