キンミライノリョウシケイサンキニムケタハイブリッドリョウシコテンマルコフレンサモンテカルロホウ

裕一郎中野, ユウイチロウナカノ

Published Jan 1, 2026• 0 citations

Abstract

Quantum computing is expected to offer exponential or polynomial speedups over classical computing for many socially important problems, including integer factorization, combinatorial optimization, and quantum chemistry.This promise has fueled strong expectations for quantum computers as next-generation computing infrastructure.Most algorithms with provable quantum advantage require large-scale quantum error correction, making fault-tolerant quantum computers (FTQC) essential.However, currently available devices are noisy intermediate-scale quantum (NISQ) devices, and further breakthroughs, such as advances in large-scale integration, are required to realize practical implementations of quantum error correction.

DOI: 10.18910/105534

Related papers

リョウシカガクケイサンニオケルジョウタイジュンビオヨビアトショリノタメノコウコウリツナリョウシアルゴリズムノカイハツ

Viktor Khinevich, ヴィクトルヒネヴィッチ

Quantum computers are anticipated to provide computational advantages over classical devices for specific classes of problems.In quantum chemistry, such an advantage can be achieved on fault-tolerant quantum computers (FTQCs) using quantum phase estimation (QPE), which can, in principle, provide accurate electronic energies with polynomial scaling.However, the practical success of QPE and related algorithms critically depends on the availability of high-quality initial quantum states with sufficient overlap with the target eigenstates.Moreover, even FTQCs are expected to be limited in size and total computational resources for the foreseeable future, restricting quantum calculations to reduced subspaces and allowing only a partial treatment of electronic correlation.For chemically meaningful predictions, the remaining correlation effects must therefore be recovered through post-processing.

Jan 1, 20260 citations

1.2 Quantum Computing – Toward Large-Scale Fault-Tolerant Quantum Computing

Heike Riel

Quantum computing is advancing rapidly, offering the potential to transform computational paradigms and tackle problems that are intractable for classical systems. Realizing practical quantum systems demands the development of an entirely new computing stack—from qubits and quantum processors to components, wiring and control electronics, transpilers, error handling, software, algorithms, and the compute architecture to integrate quantum and classical resources at scale. This plenary will provide an overview of the current state of quantum computing and outline the milestones on the path toward building a large-scale, fault-tolerant quantum computer by 2029. The significant improvements in hardware, software, and system integration, pushing the performance of quantum computing to reach quantum utility and advance toward quantum advantage, will be presented. Breakthroughs in error correction and a modular approach indicated in the IBM Quantum Roadmap outline a clear path to quantum systems using 200 logical qubits and 100 million quantum operations by 2029 and 2,000 logical qubits a few years later. Furthermore, advances in quantum algorithms, combined with the integration of quantum systems and high-performance computing (HPC), will unlock powerful synergies—accelerating the timeline for applications previously considered to be far in the future.

Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits ConferenceFeb 15, 20260 citations

Advances in Quantum Computation in NISQ Era

Xu-Dan Xie, Xiao‐Ming Zhang, Bálint Koczor +1 more

Realizing a universal, fault-tolerant quantum computer remains challenging with current technology [...].

EntropyOct 15, 20256 citations

Noisy intermediate-scale quantum (NISQ) algorithms

Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw +11 more

A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement towards realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, we provide a thorough summary of NISQ computational paradigms and algorithms. We discuss the key structure of these algorithms, their limitations, and advantages. We additionally provide a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices.

arXiv:2101.08448Jan 21, 2021164 citations

Full-stack, real-system quantum computer studies

Prakash Murali, Norbert M. Linke, Margaret Martonosi +3 more

In recent years, Quantum Computing (QC) has progressed to the point where small working prototypes are available for use. Termed Noisy Intermediate-Scale Quantum (NISQ) computers, these prototypes are too small for large benchmarks or even for Quantum Error Correction (QEC), but they do have sufficient resources to run small benchmarks, particularly if compiled with optimizations to make use of scarce qubits and limited operation counts and coherence times. QC has not yet, however, settled on a particular preferred device implementation technology, and indeed different NISQ prototypes implement qubits with very different physical approaches and therefore widely-varying device and machine characteristics.

Proceedings - International Symposium on Computer Architecture/ProceedingsJun 14, 2019127 citations

Perspectives on Quantum Sensing and Computation for Particle Physics

Alba Cervera-Lierta

A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement towards realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this talk, I provide an overview of NISQ algorithms, their limitations and potential advantages.

Jan 1, 20210 citations