Variational Quantum Algorithms in the era of Early Fault Tolerance

• URL: http://arxiv.org/abs/2503.20963v2
• Date: Tue, 13 May 2025 03:22:58 GMT
• Title: Variational Quantum Algorithms in the era of Early Fault Tolerance
• Authors: Siddharth Dangwal, Suhas Vittal, Lennart Maximillian Seifert, Frederic T. Chong, Gokul Subramanian Ravi,
• Abstract summary: Quantum computing roadmaps predict the availability of 10,000 qubit devices within the next 3-5 years.<n>We introduce partial error correction (pQEC), a strategy that error-corrects Clifford operations while performing Rz rotations via magic state injection.<n>Our results show that pQEC can improve VQA fidelities by 9.27x over standard approaches.
• Score: 2.7899834802862284
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing roadmaps predict the availability of 10,000 qubit devices within the next 3-5 years. With projected two-qubit error rates of 0.1%, these systems will enable certain operations under quantum error correction (QEC) using lightweight codes, offering significantly improved fidelities compared to the NISQ era. However, the high qubit cost of QEC codes like the surface code (especially at near-threshold physical error rates) limits the error correction capabilities of these devices. In this emerging era of Early Fault Tolerance (EFT), it will be essential to use QEC resources efficiently and focus on applications that derive the greatest benefit. In this work, we investigate the implementation of Variational Quantum Algorithms in the EFT regime (EFT-VQA). We introduce partial error correction (pQEC), a strategy that error-corrects Clifford operations while performing Rz rotations via magic state injection instead of the more expensive T-state distillation. Our results show that pQEC can improve VQA fidelities by 9.27x over standard approaches. Furthermore, we propose architectural optimizations that reduce circuit latency by ~2x, and achieve qubit packing efficiency of 66% in the EFT regime.

Related papers

• Optimization of Quantum Error Correcting Code under Temporal Variation of Qubit Quality [2.348041867134616]
  We analyze 12 days of calibration data from IBM's 127-qubit device (ibm_kyiv)<n>We propose a simple adaptive QEC approach that selects an appropriate code distance per qubit, based on daily error rates.<n>Across 12 calibration days on ibm_kyiv, our adaptive strategy reduces physical qubit overhead by over 50% per logical qubit while maintaining access to 85-100% of usable qubits.
  arXiv  Detail & Related papers  (2025-05-09T16:15:17Z)
• Controller-decoder system requirements derived by implementing Shor's algorithm with surface code [0.5592394503914488]
  Quantum Error Correction (QEC) is widely regarded as the most promising path towards quantum advantage.<n>We show that the controller-decoder closed-loop latency must remain within tens of microseconds, achievable through parallelizing decoding tasks.<n>We also simulate the complete fault-tolerant factorization circuit at the physical level, demonstrating that near-term hardware performance, such as a physical error rate of 0.1% and 1000 qubits, are sufficient for the successful execution of the circuit.
  arXiv  Detail & Related papers  (2024-11-29T23:55:29Z)
• High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture [0.5779598097190628]
  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.
  arXiv  Detail & Related papers  (2024-11-26T15:27:59Z)
• 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)
• Practical quantum advantage on partially fault-tolerant quantum computer [0.6449786007855248]
  We propose an alternative approach to achieve practical quantum advantages on early-FTQC devices. Our framework is based on partially fault-tolerant logical operations to minimize spatial overhead. We present several promising applications that leverage the potential of our framework.
  arXiv  Detail & Related papers  (2024-08-27T07:58:09Z)
• Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines [0.0]
  We show the cost of running state-of-the-art ADAPT-VQE on hardware in terms of measurement counts and circuit depth.<n>We also find that our state-of-the-art CEO-ADAPT-VQE outperforms the Unitary Coupled Cluster Singles and Doubles ansatz.
  arXiv  Detail & Related papers  (2024-07-11T17:31:30Z)
• 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)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Compilation of a simple chemistry application to quantum error correction primitives [44.99833362998488]
  We estimate the resources required to fault-tolerantly perform quantum phase estimation on a minimal chemical example. We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds.
  arXiv  Detail & Related papers  (2023-07-06T18:00:10Z)
• 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)
• 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)
• 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)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53: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.