Solving the time-complexity problem and tuning the performance of quantum reservoir computing by artificial memory restriction

• URL: http://arxiv.org/abs/2306.12876v1
• Date: Thu, 22 Jun 2023 13:37:34 GMT
• Title: Solving the time-complexity problem and tuning the performance of quantum reservoir computing by artificial memory restriction
• Authors: Saud \v{C}indrak, Brecht Donvil, Kathy L\"udge, Lina Jaurigue
• Abstract summary: The suitability of quantum reservoir computing for solving temporal tasks is hindered by the collapse of the quantum system when measurements are made. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum reservoir computing is a computing approach which aims at utilising the complexity and high-dimensionality of small quantum systems, together with the fast trainability of reservoir computing, in order to solve complex tasks. The suitability of quantum reservoir computing for solving temporal tasks is hindered by the collapse of the quantum system when measurements are made. This leads to the erasure of the memory of the reservoir. Hence, for every output, the entire input signal is needed to reinitialise the reservoir, leading to quadratic time complexity. Overcoming this issue is critical to the hardware implementation of quantum reservoir computing. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs to reinitialise the reservoir after measurements are performed, leading to linear time complexity. This not only substantially reduces the number of quantum operations needed to perform timeseries prediction tasks, it also provides a means of tuning the nonlinearity of the response of the reservoir, which can lead to significant performance improvement. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model. We find that our proposed linear algorithm not only significantly reduces the computational cost but also provides an experimental accessible means to optimise the task specific reservoir computing performance.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Practical and Scalable Quantum Reservoir Computing [0.0]
  Quantum Reservoir Computing leverages quantum systems to solve complex computational tasks with unprecedented efficiency and reduced energy consumption. This paper presents a novel QRC framework utilizing a quantum optical reservoir composed of two-level atoms within a single-mode optical cavity. We evaluate the reservoir's performance through two primary tasks: the prediction of time-series data via the classification of sine-square waveforms.
  arXiv  Detail & Related papers  (2024-05-08T04:14:31Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Randomized Polar Codes for Anytime Distributed Machine Learning [66.46612460837147]
  We present a novel distributed computing framework that is robust to slow compute nodes, and is capable of both approximate and exact computation of linear operations. We propose a sequential decoding algorithm designed to handle real valued data while maintaining low computational complexity for recovery. We demonstrate the potential applications of this framework in various contexts, such as large-scale matrix multiplication and black-box optimization.
  arXiv  Detail & Related papers  (2023-09-01T18:02:04Z)
• Optimizing quantum noise-induced reservoir computing for nonlinear and chaotic time series prediction [2.5427629797261297]
  We make advancements to the quantum noise-induced reservoir, in which reservoir noise is used as a resource to generate expressive, nonlinear signals. We show that with only a single noise model and small memory capacities, excellent simulation results were obtained on nonlinear benchmarks.
  arXiv  Detail & Related papers  (2023-03-09T18:40:03Z)
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm [58.720142291102135]
  We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL) This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
  arXiv  Detail & Related papers  (2022-10-23T11:58:05Z)
• Time Series Quantum Reservoir Computing with Weak and Projective Measurements [0.0]
  We show that it is possible to exploit the quantumness of the reservoir and to obtain ideal performance. One consists in rewinding part of the dynamics determined by the fading memory of the reservoir and storing the corresponding data of the input sequence. The other employs weak measurements operating online at the trade-off where information can be extracted accurately and without hindering the needed memory.
  arXiv  Detail & Related papers  (2022-05-13T17:57:39Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Natural quantum reservoir computing for temporal information processing [4.785845498722406]
  Reservoir computing is a temporal information processing system that exploits artificial or physical dissipative dynamics. This paper proposes the use of real superconducting quantum computing devices as the reservoir, where the dissipative property is served by the natural noise added to the quantum bits.
  arXiv  Detail & Related papers  (2021-07-13T01:58:57Z)
• Reservoir Computing Approach to Quantum State Measurement [0.0]
  Reservoir computing is a resource-efficient solution to quantum measurement of superconducting multi-qubit systems. We show how to operate this device to perform two-qubit state tomography and continuous parity monitoring.
  arXiv  Detail & Related papers  (2020-11-19T04:46:15Z)

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.