Smarter Usage of Measurement Statistics Can Greatly Improve Continuous Variable Quantum Reservoir Computing

• URL: http://arxiv.org/abs/2507.03557v1
• Date: Fri, 04 Jul 2025 13:09:44 GMT
• Title: Smarter Usage of Measurement Statistics Can Greatly Improve Continuous Variable Quantum Reservoir Computing
• Authors: Markku Hahto, Johannes Nokkala,
• Abstract summary: Quantum reservoir computing is a machine learning scheme in which a quantum system is used to perform information processing.<n>We consider storing past measurement results in classical memory, and show that it improves the memory capacity and can be used to mitigate the effects of statistical noise.
• Score: 1.03590082373586
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum reservoir computing is a machine learning scheme in which a quantum system is used to perform information processing. A prospective approach to its physical realization is a photonic platform in which continuous variable (CV) quantum information methods are applied. The simplest CV quantum states are Gaussian states, which can be efficiently simulated classically. As such, they provide a benchmark for the level of performance that non-Gaussian states should surpass in order to give a quantum advantage. In this article we propose two methods to extract more performance from Gaussian states compared to previous protocols. We consider better utilization of the measurement distribution by sampling its cumulative distribution function. We show it provides memory in areas that conventional approaches are lacking, as well as improving the overall processing capacity of the reservoir. We also consider storing past measurement results in classical memory, and show that it improves the memory capacity and can be used to mitigate the effects of statistical noise due to finite measurement ensemble.

Related papers

• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• Quantum Coherent State Transform on Continuous-Variable Systems [5.918397923896909]
  We introduce the quantum coherent state transform(QCST) and a framework for implementing it in continuous-variable quantum systems.<n>Measurement of the resulting quantum state is equivalent to a positive operator-valued measure (POVM) with elements $leftfrac1pi left|alpharightrangle leftlanglealpharight| right_alpha.
  arXiv  Detail & Related papers  (2024-12-17T12:51:35Z)
• Memory-Augmented Hybrid Quantum Reservoir Computing [0.0]
  We present a hybrid quantum-classical approach that implements memory through classical post-processing of quantum measurements. We tested our model on two physical platforms: a fully connected Ising model and a Rydberg atom array.
  arXiv  Detail & Related papers  (2024-09-15T22:44:09Z)
• A Fast and Stable Marginal-Likelihood Calibration Method with Application to Quantum Characterization [0.0]
  We present a marginal likelihood strategy integrated into the Kennedy-O'Hagan (KOH) Bayesian framework.<n>The proposed method is both computationally efficient and numerically stable, even in large dataset regimes.
  arXiv  Detail & Related papers  (2023-08-24T04:39:18Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Benchmarking the role of particle statistics in Quantum Reservoir Computing [0.0]
  We study the ability of bosons, fermions, and qubits to store information from past inputs by measuring linear and nonlinear memory capacity. For the simplest reservoir Hamiltonian choice, fermions provide the best reservoir due to their intrinsic nonlocal properties. A tailored input injection strategy allows the exploitation of the abundance of degrees of freedom of the Hilbert space for bosonic quantum reservoir computing.
  arXiv  Detail & Related papers  (2023-02-14T16:23:46Z)
• Demonstration of machine-learning-enhanced Bayesian quantum state estimation [0.0]
  We experimentally realize an approach for defining custom prior distributions that are automatically tuned using machine learning. We show that ML-defined prior distributions reduce net convergence times and provide a natural way to incorporate both implicit and explicit information directly into the prior distribution.
  arXiv  Detail & Related papers  (2022-12-15T18:41:15Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Toward a quantum computing algorithm to quantify classical and quantum correlation of system states [0.0]
  We design a variational hybrid quantum-classical (VHQC) algorithm to achieve classical and quantum correlations for system states. We numerically test the performance of our algorithm at finding a correlation of some density matrices.
  arXiv  Detail & Related papers  (2021-11-17T09:40:30Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Fast and robust quantum state tomography from few basis measurements [65.36803384844723]
  We present an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy. The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory. Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.
  arXiv  Detail & Related papers  (2020-09-17T11:28:41Z)

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.