High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture

• URL: http://arxiv.org/abs/2411.17519v1
• Date: Tue, 26 Nov 2024 15:27:59 GMT
• Title: High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture
• Authors: Yosuke Ueno, Taku Saito, Teruo Tanimoto, Yasunari Suzuki, Yutaka Tabuchi, Shuhei Tamate, Hiroshi Nakamura,
• Abstract summary: We propose a high-performance and low-overhead FTQC architecture based on lattice surgery (LS) using surface code (SC) The proposed Bypass architecture is a 2.5-dimensional architecture consisting of dense and sparse qubit layers. The results show that the Bypass architecture improves the fidelity of FTQC and both a 1.73x speedup and a 17% reduction in classical/quantum hardware resources.
• Score: 0.5779598097190628
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Due to the high error rate of a qubit, detecting and correcting errors on it is essential for fault-tolerant quantum computing (FTQC). Among several FTQC techniques, lattice surgery (LS) using surface code (SC) is currently promising. To demonstrate practical quantum advantage as early as possible, it is indispensable to propose a high-performance and low-overhead FTQC architecture specialized for a given FTQC scheme based on detailed analysis. In this study, we first categorize the factors, or hazards, that degrade LS-based FTQC performance and propose a performance evaluation methodology to decompose the impact of each hazard, inspired by the CPI stack. We propose the Bypass architecture based on the bottleneck analysis using the proposed evaluation methodology. The proposed Bypass architecture is a 2.5-dimensional architecture consisting of dense and sparse qubit layers and successfully eliminates the bottleneck to achieve high-performance and scalable LS-based FTQC. We evaluate the proposed architecture with a circuit-level stabilizer simulator and a cycle-accurate LS simulator with practical quantum phase estimation problems. The results show that the Bypass architecture improves the fidelity of FTQC and achieves both a 1.73x speedup and a 17% reduction in classical/quantum hardware resources over a conventional 2D architecture.

Related papers

• Flexion: Adaptive In-Situ Encoding for On-Demand QEC in Ion Trap Systems [16.77947483425163]
  A key near-term goal is to build a system capable of executing millions of logical operations reliably. We propose a novel system architecture targeting MQC on trapped-ion quantum computers. We propose Flexion, a hybrid encoding scheme that uses bare qubits for 1Q gates and QEC-encoded logical qubits for 2Q gates.
  arXiv  Detail & Related papers  (2025-04-22T22:44:47Z)
• 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)
• Q3DE: A fault-tolerant quantum computer architecture for multi-bit burst errors by cosmic rays [2.5387423427791047]
  We propose an FTQC architecture that enhances the tolerance to multi-bit burst errors (MBBEs) by cosmic rays with moderate changes and overhead. We show that Q3DE effectively reduces the period of MBBEs by 1000 times and halves the size of their region.
  arXiv  Detail & Related papers  (2024-12-31T08:04:58Z)
• Contrasting Statistical Phase Estimation with the Variational Quantum Eigensolver in the era of Early Fault Tolerant Quantum Computation [0.0]
  We first review the recently developed space-time efficient analogue rotation (STAR) architecture citeakahoshiPartiallyFaultTolerantQuantum2024. In particular, the class of ground state energy estimation (GSEE) algorithm known as the statistical phase estimation algorithm (SPE) is studied.
  arXiv  Detail & Related papers  (2024-09-12T04:48:05Z)
• Compilation of Trotter-Based Time Evolution for Partially Fault-Tolerant Quantum Computing Architecture [0.6449786007855248]
  We present an efficient method for simulating the time evolution of the 2D Hubbard model Hamiltonian. Our analysis reveals an acceleration of over 10 times compared to naive serial compilation. For devices with a physical error rate of $p_rm phys = 10-4$, we estimate that approximately $6.5 times 104$ physical qubits are required to achieve faster ground state energy estimation.
  arXiv  Detail & Related papers  (2024-08-27T10:07:34Z)
• Trainability maximization using estimation of distribution algorithms assisted by surrogate modelling for quantum architecture search [8.226785409557598]
  Quantum architecture search (QAS) involves optimizing both the quantum parametric circuit configuration but also its parameters for a variational quantum algorithm. In this paper, we aim to achieve two improvements in QAS: (1) to reduce the number of measurements by an online surrogate model of the evaluation process that aggressively discards architectures of poor performance; (2) to avoid training the circuits when BPs are present. We experimentally validate our proposal for the variational quantum eigensolver and showcase that our algorithm is able to find solutions that have been previously proposed in the literature for the Hamiltonians; but also to outperform the state of the
  arXiv  Detail & Related papers  (2024-07-29T15:22:39Z)
• Mechanistic Design and Scaling of Hybrid Architectures [114.3129802943915]
  We identify and test new hybrid architectures constructed from a variety of computational primitives. We experimentally validate the resulting architectures via an extensive compute-optimal and a new state-optimal scaling law analysis. We find MAD synthetics to correlate with compute-optimal perplexity, enabling accurate evaluation of new architectures.
  arXiv  Detail & Related papers  (2024-03-26T16:33:12Z)
• Curriculum reinforcement learning for quantum architecture search under hardware errors [1.583327010995414]
  This work introduces a curriculum-based reinforcement learning QAS (CRLQAS) designed to tackle challenges in VQA deployment. The algorithm incorporates (i) a 3D architecture encoding and restrictions on environment dynamics to explore the search space of possible circuits efficiently. To facilitate studies, we developed an optimized simulator for our algorithm, significantly improving computational efficiency in noisy quantum circuits.
  arXiv  Detail & Related papers  (2024-02-05T20:33:00Z)
• Modeling the Performance of Early Fault-Tolerant Quantum Algorithms [2.9263797260822835]
  We propose a methodology for modeling algorithm performance on EFTQC devices under varying degrees of error. We investigate the runtime performance and the fault-tolerant overhead of an EFTQC algorithm for phase estimation. Our analysis reveals that RFE achieves significant savings in physical qubit counts while having a much higher runtime upper bound.
  arXiv  Detail & Related papers  (2023-06-29T18:03:15Z)
• FlowNAS: Neural Architecture Search for Optical Flow Estimation [65.44079917247369]
  We propose a neural architecture search method named FlowNAS to automatically find the better encoder architecture for flow estimation task. Experimental results show that the discovered architecture with the weights inherited from the super-network achieves 4.67% F1-all error on KITTI.
  arXiv  Detail & Related papers  (2022-07-04T09:05:25Z)
• iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradients [75.41173109807735]
  Differentiable ARchiTecture Search (DARTS) has recently become the mainstream of neural architecture search (NAS) We tackle the hypergradient computation in DARTS based on the implicit function theorem. We show that the architecture optimisation with the proposed method, named iDARTS, is expected to converge to a stationary point.
  arXiv  Detail & Related papers  (2021-06-21T00:44:11Z)
• FactorizeNet: Progressive Depth Factorization for Efficient Network Architecture Exploration Under Quantization Constraints [93.4221402881609]
  We introduce a progressive depth factorization strategy for efficient CNN architecture exploration under quantization constraints. By algorithmically increasing the granularity of depth factorization in a progressive manner, the proposed strategy enables a fine-grained, low-level analysis of layer-wise distributions. Such a progressive depth factorization strategy also enables efficient identification of the optimal depth-factorized macroarchitecture design.
  arXiv  Detail & Related papers  (2020-11-30T07:12:26Z)
• A Statistical Framework for Low-bitwidth Training of Deep Neural Networks [70.77754244060384]
  Fully quantized training (FQT) uses low-bitwidth hardware by quantizing the activations, weights, and gradients of a neural network model. One major challenge with FQT is the lack of theoretical understanding, in particular of how gradient quantization impacts convergence properties.
  arXiv  Detail & Related papers  (2020-10-27T13:57:33Z)
• Once Quantization-Aware Training: High Performance Extremely Low-bit Architecture Search [112.05977301976613]
  We propose to combine Network Architecture Search methods with quantization to enjoy the merits of the two sides. We first propose the joint training of architecture and quantization with a shared step size to acquire a large number of quantized models. Then a bit-inheritance scheme is introduced to transfer the quantized models to the lower bit, which further reduces the time cost and improves the quantization accuracy.
  arXiv  Detail & Related papers  (2020-10-09T03:52:16Z)

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.