Q3DE: A fault-tolerant quantum computer architecture for multi-bit burst errors by cosmic rays

• URL: http://arxiv.org/abs/2501.00331v1
• Date: Tue, 31 Dec 2024 08:04:58 GMT
• Title: Q3DE: A fault-tolerant quantum computer architecture for multi-bit burst errors by cosmic rays
• Authors: Yasunari Suzuki, Takanori Sugiyama, Tomochika Arai, Wang Liao, Koji Inoue, Teruo Tanimoto,
• Abstract summary: We propose an FTQC architecture that enhances the tolerance to multi-bit burst errors (MBBEs) by cosmic rays with moderate changes and overhead.<n>We show that Q3DE effectively reduces the period of MBBEs by 1000 times and halves the size of their region.
• Score: 2.5387423427791047
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Demonstrating small error rates by integrating quantum error correction (QEC) into an architecture of quantum computing is the next milestone towards scalable fault-tolerant quantum computing (FTQC). Encoding logical qubits with superconducting qubits and surface codes is considered a promising candidate for FTQC architectures. In this paper, we propose an FTQC architecture, which we call Q3DE, that enhances the tolerance to multi-bit burst errors (MBBEs) by cosmic rays with moderate changes and overhead. There are three core components in Q3DE: in-situ anomaly DEtection, dynamic code DEformation, and optimized error DEcoding. In this architecture, MBBEs are detected only from syndrome values for error correction. The effect of MBBEs is immediately mitigated by dynamically increasing the encoding level of logical qubits and re-estimating probable recovery operation with the rollback of the decoding process. We investigate the performance and overhead of the Q3DE architecture with quantum-error simulators and demonstrate that Q3DE effectively reduces the period of MBBEs by 1000 times and halves the size of their region. Therefore, Q3DE significantly relaxes the requirement of qubit density and qubit chip size to realize FTQC. Our scheme is versatile for mitigating MBBEs, i.e., temporal variations of error properties, on a wide range of physical devices and FTQC architectures since it relies only on the standard features of topological stabilizer codes.

Related papers

• Fault-tolerant logical state construction based on cavity-QED network [0.196629787330046]
  We propose and evaluate a scalable and practical architecture with a cavity-quantum-electrodynamics (CQED) network. Our architecture takes advantage of the stability of neutral atoms and the flexibility of a CQED network.
  arXiv  Detail & Related papers  (2025-03-14T15:26:29Z)
• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Architectures for Heterogeneous Quantum Error Correction Codes [13.488578754808676]
  Heterogeneous architectures provide a clear path to universal logical computation. We propose integrating the surface code and gross code using an ancilla bus for inter-code data movement. We demonstrate physical qubit reductions of up to 6.42x when executing an algorithm to a specific logical error rate.
  arXiv  Detail & Related papers  (2024-11-05T15:49:02Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• 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)
• Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes [0.0]
  We introduce Ambiguity Clustering (AC), an algorithm which seeks to divide measurement data into clusters which are decoded independently. AC is between one and three orders of magnitude faster than BP-OSD with no reduction in logical fidelity. Our CPU implementation of AC is already fast enough to decode the 144-qubit Gross code in real time for neutral atom and trapped ion systems.
  arXiv  Detail & Related papers  (2024-06-20T17:39:31Z)
• Enabling Full-Stack Quantum Computing with Changeable Error-Corrected Qubits [14.770636234849444]
  We propose CECQ to explore the large design space for FTQC based on changeable logical qubits. Experiments on various quantum programs demonstrate the effectiveness of CECQ.
  arXiv  Detail & Related papers  (2023-05-11T18:14:49Z)
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations [0.5658123802733283]
  We propose a quantum computing architecture to close the gap between NISQ and FTQC. For early-FTQC devices, we can perform roughly $1.72 times 107$ Clifford operations and $3.75 times 104$ arbitrary rotations on 64 logical qubits.
  arXiv  Detail & Related papers  (2023-03-23T11:21:41Z)
• 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)
• 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)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Single-shot quantum error correction with the three-dimensional subsystem toric code [77.34726150561087]
  We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC) The 3D STC can be realized by measuring geometrically-local parity checks of weight at most three on the cubic lattice with open boundary conditions.
  arXiv  Detail & Related papers  (2021-06-04T17:35:00Z)

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.