Practical quantum advantage on partially fault-tolerant quantum computer

• URL: http://arxiv.org/abs/2408.14848v1
• Date: Tue, 27 Aug 2024 07:58:09 GMT
• Title: Practical quantum advantage on partially fault-tolerant quantum computer
• Authors: Riki Toshio, Yutaro Akahoshi, Jun Fujisaki, Hirotaka Oshima, Shintaro Sato, Keisuke Fujii,
• Abstract summary: 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.
• Score: 0.6449786007855248
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles such as inevitable physical errors and the limited scalability of current near-term algorithms. Meanwhile, assuming a typical architecture for fault-tolerant quantum computing (FTQC), realistic applications inevitably require a vast number of qubits, typically exceeding $10^6$, which seems far beyond near-term realization. In this work, to bridge the gap between the NISQ and FTQC eras, 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 and avoids the costly distillation techniques typically required for executing non-Clifford gates. To this end, we develop a space-time efficient state preparation protocol to generate an ancillary non-Clifford state consumed for implementing an analog rotation gate with an arbitrary small angle $\theta$ and a remarkably low worst-case error rate below $\mathcal{O}(|\theta| p_{\text{ph}})$, where $p_{\text{ph}}$ is the physical error rate. Furthermore, we propose several error suppression schemes tailored to our preparation protocol, which are essential to minimize the overhead for mitigating errors. Based on this framework, we present several promising applications that leverage the potential of our framework, including the Trotter simulation and quantum phase estimation (QPE). Notably, we demonstrate that our framework allows us to perform the QPE for $(8\times 8)$-site Hubbard model with fewer than $4.9\times 10^4$ qubits and an execution time of 9 days (or 12 minutes with full parallelization) under $p_{\text{ph}}=10^{-4}$, which is significantly faster than recent classical estimation with tensor network techniques (DMRG and PEPS).

Related papers

• Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures [0.8642846017977626]
  We consider a concept architecture comprising a dedicated zone as a multi-level magic state factory and a core processor for efficient logical operations. We show that, in the proposed architecture, $105$--$108$ physical qubits are required for quantum algorithms with $T$--$1015$ and logical qubit counts in the range $102$--$104$, when run on quantum computers with quantum memory.
  arXiv  Detail & Related papers  (2024-11-06T21:25:34Z)
• 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)
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation [0.0]
  This paper proposes a hybrid quantum-classical algorithm for compiling the time-evolution operator. It achieves a 95% reduction in circuit depth compared to Trotterization while maintaining accuracy. We estimate the gate count needed to execute the quantum simulations using the LSVQC on near-term quantum computing architectures.
  arXiv  Detail & Related papers  (2024-07-19T09:50:01Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• 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)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras [0.9622115055919379]
  In the early years of fault-tolerant quantum computing (FTQC), the available code distance and the number of magic states will be restricted. Here, we integrate quantum error correction and quantum error mitigation into an efficient FTQC architecture. This scheme will dramatically alleviate the required computational overheads and hasten the arrival of the FTQC era.
  arXiv  Detail & Related papers  (2020-10-08T10:27:29Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)

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.