Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical review. E

Optimal quantum reservoir computing for the noisy intermediate-scale quantum era

Laia Domingo, Gabriel G. Carlo, F. Borondo

Published Oct 13, 2022• 31 citations
Publisher

Abstract

Universal fault-tolerant quantum computers require millions of qubits with low error rates. Since this technology is years ahead, noisy intermediate-scale quantum (NISQ) computation is receiving tremendous interest. In this setup, quantum reservoir computing is a relevant machine learning algorithm. Its simplicity of training and implementation allows to perform challenging computations on today's available machines. In this Letter, we provide a criterion to select optimal quantum reservoirs, requiring few and simple gates. Our findings demonstrate that they render better results than other commonly used models with significantly less gates and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states' complexity.

DOI
10.1103/physreve.106.l043301

Related papers

Optimal quantum reservoir computing for the NISQ era

L. Domingo, G. Carlo, F. Borondo

Universal fault-tolerant quantum computers require millions of qubits with low error rates. Since this technology is years ahead, noisy intermediate-scale quantum (NISQ) computation is receiving tremendous interest. In this setup, quantum reservoir computing is a relevant machine learning algorithm. Its simplicity of training and implementation allows to perform challenging computations on today available machines. In this Letter, we provide a criterion to select optimal quantum reservoirs, requiring few and simple gates. Our findings demonstrate that they render better results than other commonly used models with significantly less gates, and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states complexity.

arXiv:2205.10107•May 20, 2022•0 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.08448•Jan 21, 2021•164 citations

Perspectives on Quantum Sensing and Computation for Particle Physics

Alba Cervera-Lierta

<!--HTML-->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, 2021•0 citations

Quantum reservoir complexity by the Krylov evolution approach

Laia Domingo, F. Borondo, Gastón F. Scialchi +3 more

Quantum reservoir computing algorithms recently emerged as a standout approach in the development of successful methods for the noisy intermediate-scale quantum (NISQ) era because of its superb performance and compatibility with current quantum devices. By harnessing the properties and dynamics of a quantum system, quantum reservoir computing effectively uncovers hidden patterns in data. However, the design of the quantum reservoir is crucial to this end in order to ensure an optimal performance of the algorithm. In this work, we introduce a precise quantitative method with strong physical foundations based on the Krylov evolution to assess the wanted good performance in machine-learning tasks. Our results show that the Krylov approach to complexity strongly correlates with quantum reservoir performance, making it a powerful tool in the quest for optimally designed quantum reservoirs, which will pave the road to the implementation of successful quantum machine-learning methods.

Physical Review A•Aug 30, 2024•8 citations

Low-Overhead Quantum Error Correction Codes for Noisy Intermediate-Scale Quantum Devices

D. Jagadeesan, A. B. Manju, G. Asha +4 more

Noisy Intermediate-Scale Quantum (NISQ) devices represent current quantum computing technology with 50-1000 qubits operating without comprehensive fault-tolerant error correction. The fundamental challenge lies in balancing error correction necessity against prohibitive resource overhead. Conventional quantum error correction codes require 10:1 to 1000:1 qubit ratios and syndrome extraction circuits exceeding 50 gates, consuming entire NISQ capacities. This work presents a comprehensive low-overhead quantum error correction framework specifically designed for NISQ constraints. Our approach combines three elements: optimised stabiliser codes which get qubit ratios of 3:1 to 10:1, adaptive syndrome extraction which works with circuits with less than 20 gates and machine learning-enhanced decoding which is specific to the noise profiles of the hardware. Experimental validation on IBM Quantum (127- qubit Eagle), IonQ trapped-ion systems, and Google Sycamore simulation demonstrates successful quantum state protection achieving 2.7× error suppression with 60% overhead reduction versus conventional surface codes. The proposed code achieves logical error rates of 0.0065 using only 10 physical qubits compared to 25 qubits for equivalent surface codes. Machine learning decoder attains 94.3% accuracy with 12-microsecond inference latency, enabling real-time error correction. Break-even performance achieved at 0.8% physical error rates establishes practical pathways for near-term quantum advantage in variational algorithms and quantum simulation applications.

EPJ Web of Conferences•Jan 1, 2026•0 citations

Low-Overhead Quantum Error Correction Codes for Noisy Intermediate-Scale Quantum Devices

D. Jagadeesan, A. B. Manju, G. Asha +4 more

Noisy Intermediate-Scale Quantum (NISQ) devices represent current quantum computing technology with 50-1000 qubits operating without comprehensive fault-tolerant error correction. The fundamental challenge lies in balancing error correction necessity against prohibitive resource overhead. Conventional quantum error correction codes require 10:1 to 1000:1 qubit ratios and syndrome extraction circuits exceeding 50 gates, consuming entire NISQ capacities. This work presents a comprehensive low-overhead quantum error correction framework specifically designed for NISQ constraints. Our approach combines three elements: optimised stabiliser codes which get qubit ratios of 3:1 to 10:1, adaptive syndrome extraction which works with circuits with less than 20 gates and machine learning-enhanced decoding which is specific to the noise profiles of the hardware. Experimental validation on IBM Quantum (127- qubit Eagle), IonQ trapped-ion systems, and Google Sycamore simulation demonstrates successful quantum state protection achieving 2.7× error suppression with 60% overhead reduction versus conventional surface codes. The proposed code achieves logical error rates of 0.0065 using only 10 physical qubits compared to 25 qubits for equivalent surface codes. Machine learning decoder attains 94.3% accuracy with 12-microsecond inference latency, enabling real-time error correction. Break-even performance achieved at 0.8% physical error rates establishes practical pathways for near-term quantum advantage in variational algorithms and quantum simulation applications.

•Mar 23, 2026•0 citations
Universal fault-tolerant quantum computers require millions of qubits with low error rates. Since this technology is years ahead, noisy intermediate-scale quantum (NISQ) computation is receiving tremendous interest. In this setup, quantum reservoir computing is a relevant machine learning algorithm. Its simplicity of training and implementation allows to perform challenging computations on today's available machines. In this Letter, we provide a criterion to select optimal quantum reservoirs, requiring few and simple gates. Our findings demonstrate that they render better results than other commonly used models with significantly less gates and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states' complexity.
Universal fault-tolerant quantum computers require millions of qubits with low error rates. Since this technology is years ahead, noisy intermediate-scale quantum (NISQ) computation is receiving tremendous interest. In this setup, quantum reservoir computing is a relevant machine learning algorithm. Its simplicity of training and implementation allows to perform challenging computations on today available machines. In this Letter, we provide a criterion to select optimal quantum reservoirs, requiring few and simple gates. Our findings demonstrate that they render better results than other commonly used models with significantly less gates, and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states complexity.
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.
<!--HTML-->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.
Quantum reservoir computing algorithms recently emerged as a standout approach in the development of successful methods for the noisy intermediate-scale quantum (NISQ) era because of its superb performance and compatibility with current quantum devices. By harnessing the properties and dynamics of a quantum system, quantum reservoir computing effectively uncovers hidden patterns in data. However, the design of the quantum reservoir is crucial to this end in order to ensure an optimal performance of the algorithm. In this work, we introduce a precise quantitative method with strong physical foundations based on the Krylov evolution to assess the wanted good performance in machine-learning tasks. Our results show that the Krylov approach to complexity strongly correlates with quantum reservoir performance, making it a powerful tool in the quest for optimally designed quantum reservoirs, which will pave the road to the implementation of successful quantum machine-learning methods.
Noisy Intermediate-Scale Quantum (NISQ) devices represent current quantum computing technology with 50-1000 qubits operating without comprehensive fault-tolerant error correction. The fundamental challenge lies in balancing error correction necessity against prohibitive resource overhead. Conventional quantum error correction codes require 10:1 to 1000:1 qubit ratios and syndrome extraction circuits exceeding 50 gates, consuming entire NISQ capacities. This work presents a comprehensive low-overhead quantum error correction framework specifically designed for NISQ constraints. Our approach combines three elements: optimised stabiliser codes which get qubit ratios of 3:1 to 10:1, adaptive syndrome extraction which works with circuits with less than 20 gates and machine learning-enhanced decoding which is specific to the noise profiles of the hardware. Experimental validation on IBM Quantum (127- qubit Eagle), IonQ trapped-ion systems, and Google Sycamore simulation demonstrates successful quantum state protection achieving 2.7× error suppression with 60% overhead reduction versus conventional surface codes. The proposed code achieves logical error rates of 0.0065 using only 10 physical qubits compared to 25 qubits for equivalent surface codes. Machine learning decoder attains 94.3% accuracy with 12-microsecond inference latency, enabling real-time error correction. Break-even performance achieved at 0.8% physical error rates establishes practical pathways for near-term quantum advantage in variational algorithms and quantum simulation applications.
Noisy Intermediate-Scale Quantum (NISQ) devices represent current quantum computing technology with 50-1000 qubits operating without comprehensive fault-tolerant error correction. The fundamental challenge lies in balancing error correction necessity against prohibitive resource overhead. Conventional quantum error correction codes require 10:1 to 1000:1 qubit ratios and syndrome extraction circuits exceeding 50 gates, consuming entire NISQ capacities. This work presents a comprehensive low-overhead quantum error correction framework specifically designed for NISQ constraints. Our approach combines three elements: optimised stabiliser codes which get qubit ratios of 3:1 to 10:1, adaptive syndrome extraction which works with circuits with less than 20 gates and machine learning-enhanced decoding which is specific to the noise profiles of the hardware. Experimental validation on IBM Quantum (127- qubit Eagle), IonQ trapped-ion systems, and Google Sycamore simulation demonstrates successful quantum state protection achieving 2.7× error suppression with 60% overhead reduction versus conventional surface codes. The proposed code achieves logical error rates of 0.0065 using only 10 physical qubits compared to 25 qubits for equivalent surface codes. Machine learning decoder attains 94.3% accuracy with 12-microsecond inference latency, enabling real-time error correction. Break-even performance achieved at 0.8% physical error rates establishes practical pathways for near-term quantum advantage in variational algorithms and quantum simulation applications.