Related papers: Optimal quantum reservoir computing for the NISQ era

Optimal quantum reservoir computing for the NISQ era

URL: http://arxiv.org/abs/2205.10107v1
Date: Fri, 20 May 2022 12:00:27 GMT
Title: Optimal quantum reservoir computing for the NISQ era
Authors: L. Domingo, G. Carlo, and F. Borondo
Abstract summary: 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.
Score: 0.0
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
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 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.

Related papers

Quantum Circuit Learning on NISQ Hardware [0.0]
Current quantum computers are small and error-prone systems. Fault-tolerant quantum computers are not expected to be available in the near future. We show that exemplary QCL circuits with up to three qubits are executable on the IBM quantum computer.
arXiv Detail & Related papers (2024-05-03T13:00:32Z)
Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z)
ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures [0.18188255328029254]
We introduce the ArsoNISQ framework that determines the tolerable error rate of a given quantum algorithm. ArsoNISQ is based on simulations of quantum circuits subject to errors according to the Pauli error model.
arXiv Detail & Related papers (2023-01-18T02:09:48Z)
Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z)
Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z)
Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z)
Quantum reservoir computation utilising scale-free networks [0.0]
We introduce a new reservoir computational model for pattern recognition showing a quantum advantage utilizing scale-free networks. The simplicity in our approach illustrates the computational power in quantum complexity as well as provide new applications for such processors.
arXiv Detail & Related papers (2021-08-27T06:28:08Z)
Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
arXiv Detail & Related papers (2021-03-31T02:41:36Z)
An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation [7.92565122267857]
We present a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse. Our results show that SQUARE improves the average success rate of NISQ applications by 1.47X.
arXiv Detail & Related papers (2020-04-18T06:34:37Z)
Simulating quantum chemistry in the seniority-zero space on qubit-based quantum computers [0.0]
We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers. We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
arXiv Detail & Related papers (2020-01-31T19:44:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.