Quantum reservoir complexity by Krylov evolution approach
- URL: http://arxiv.org/abs/2310.00790v1
- Date: Sun, 1 Oct 2023 21:06:25 GMT
- Title: Quantum reservoir complexity by Krylov evolution approach
- Authors: Laia Domingo, F. Borondo, Gast\'on Scialchi, Augusto J. Roncaglia,
Gabriel G. Carlo, and Diego A. Wisniacki
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Quantum reservoir computing algorithms recently emerged as a standout
approach in the development of successful methods for the 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.
Related papers
- MindSpore Quantum: A User-Friendly, High-Performance, and AI-Compatible Quantum Computing Framework [20.585698216552892]
We introduce MindSpore Quantum, a pioneering hybrid quantum-classical framework with a primary focus on noisy intermediate-scale quantum (NISQ) algorithms.
In addition to the core framework, we introduce QuPack, a meticulously crafted quantum computing acceleration engine.
arXiv Detail & Related papers (2024-06-25T03:28:40Z) - Quantum Mixed-State Self-Attention Network [3.1280831148667105]
This paper introduces a novel Quantum Mixed-State Attention Network (QMSAN), which integrates the principles of quantum computing with classical machine learning algorithms.
QMSAN model employs a quantum attention mechanism based on mixed states, enabling efficient direct estimation of similarity between queries and keys within the quantum domain.
Our study investigates the model's robustness in different quantum noise environments, showing that QMSAN possesses commendable robustness to low noise.
arXiv Detail & Related papers (2024-03-05T11:29:05Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Neural auto-designer for enhanced quantum kernels [59.616404192966016]
We present a data-driven approach that automates the design of problem-specific quantum feature maps.
Our work highlights the substantial role of deep learning in advancing quantum machine learning.
arXiv Detail & Related papers (2024-01-20T03:11:59Z) - Efficient Quantum Modular Arithmetics for the ISQ Era [0.0]
This study presents an array of quantum circuits, each precision-engineered for modular arithmetic functions.
We provide a theoretical framework and practical implementations in the PennyLane quantum software.
arXiv Detail & Related papers (2023-11-14T21:34:39Z) - Classical and quantum reservoir computing: development and applications
in machine learning [0.0]
Reservoir computing is a novel machine learning algorithm that uses a nonlinear dynamical system to learn complex temporal patterns from data.
The research demonstrates the algorithm's robustness and adaptability across very different domains, including agricultural time series forecasting.
The last contribution of this thesis focuses on optimizing algorithm designs for quantum reservoir computing.
arXiv Detail & Related papers (2023-10-11T13:01:05Z) - Efficient VQE Approach for Accurate Simulations on the Kagome Lattice [0.0]
This study focuses on using multiple ansatz models to create an effective Variational Quantum Eigensolver (VQE) on the Kagome lattice.
By comparing various optimisation methods and optimising the VQE ansatz models, the main goal is to estimate ground state attributes with high accuracy.
arXiv Detail & Related papers (2023-06-01T09:14:34Z) - 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) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
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.