Quantum reservoir computing using the stabilizer formalism for encoding classical data

• URL: http://arxiv.org/abs/2407.00445v1
• Date: Sat, 29 Jun 2024 13:59:51 GMT
• Title: Quantum reservoir computing using the stabilizer formalism for encoding classical data
• Abstract summary: We provide a generalization of the standard way to robustly en- and decode time series into subspaces defined by the cosets of a given stabilizer. A key observation is the necessity to perform the decoding step, which in turn ensures a consistent way of encoding. Our numerical findings indicate that the system's performance is increasing with the length of the training data.
• Score: 39.58317527488534
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Utilizing a quantum system for reservoir computing has recently received a lot of attention. Key challenges are related to how on can optimally en- and decode classical information, as well as what constitutes a good reservoir. Our main contribution is a generalization of the standard way to robustly en- and decode time series into subspaces defined by the cosets of a given stabilizer. A key observation is the necessity to perform the decoding step, which in turn ensures a consistent way of encoding. This provides a systematic way to encode classical information in a robust way. We provide a numerical analysis on a discrete time series given by two standard maps, namely the logistic and the H\'enon map. Our numerical findings indicate that the system's performance is increasing with the length of the training data.

Related papers

• Training-Free Hashing-Based Attention via Binary Principal Components [62.88957443238231]
  Long-context large language models (LLMs) are increasingly deployed in real-world applications.<n>Existing sparse attention reduce computation by attending to fewer KV pairs, but often suffer from substantial accuracy degradation.<n>We present BinaryPC, a training-free, data-aware hashing-based sparse attention for long-context LLMs.
  arXiv  Detail & Related papers  (2026-08-05T03:19:21Z)
• Recurrent Quantum Feature Maps for Reservoir Computing [0.6299766708197881]
  We introduce a reservoir based on recurrent quantum feature maps where a fixed quantum circuit is reused to encode both current inputs and a classical feedback signal derived from previous outputs.<n>We evaluate the model on the Mackey-Glass time-series prediction task using our recently introduced CP feature map, and find that it achieves lower mean squared error than standard classical baselines.
  arXiv  Detail & Related papers  (2026-04-03T21:33:10Z)
• A mathematical framework for time-delay reservoir computing analysis [0.0]
  Reservoir computing is a well-established approach for processing data with a much lower complexity than neural networks.<n>Despite two decades of experimental progress, the core properties of reservoir computing still lack rigorous mathematical foundations.<n>This paper addresses this gap by providing a control-theoretic framework for the analysis of time-delay-based reservoir computers.
  arXiv  Detail & Related papers  (2026-03-19T10:05:31Z)
• QuaRK: A Quantum Reservoir Kernel for Time Series Learning [11.195918728130088]
  QuaRK is an end-to-end framework that couples a hardware-realistic quantum reservoir featurizer with a kernel-based readout scheme.<n>We provide learning-theoretic guarantees for dependent temporal data, linking design and resource choices to finite-sample performance.
  arXiv  Detail & Related papers  (2026-02-14T00:04:52Z)
• Implementing Semiclassical Szegedy Walks in Classical-Quantum Circuits for Homomorphic Encryption [0.0]
  Quantum homomorphic encryption (QHE) is an emerging technology that facilitates secure computation on quantum data without revealing the underlying information. We reinterpret QHE schemes through classical-quantum circuits, enhancing efficiency and addressing previous limitations related to key computations. Our approach eliminates the need for exponential key preparation by calculating keys in real-time during simulation, leading to a linear complexity in classically controlled gates.
  arXiv  Detail & Related papers  (2024-12-02T20:50:48Z)
• Data is often loadable in short depth: Quantum circuits from tensor networks for finance, images, fluids, and proteins [0.0]
  We introduce a circuit compilation method based on tensor network (TN) theory. We perform numerical experiments on real-world classical data from four distinct areas. This is the broadest numerical analysis to date of loading classical data into a quantum computer.
  arXiv  Detail & Related papers  (2023-09-22T18:00:01Z)
• Quantum Algorithms for State Preparation and Data Classification based on Stabilizer Codes [0.0]
  We propose a prototype quantum circuit model for classification of classical data. A quantum neural network (QNN) layer is realized by a stabilizer code which consists of many stabilizers. We also consider the first challenge to most applications of quantum computers, including data classification.
  arXiv  Detail & Related papers  (2023-09-18T19:02:54Z)
• Learning Representations for CSI Adaptive Quantization and Feedback [51.14360605938647]
  We propose an efficient method for adaptive quantization and feedback in frequency division duplexing systems. Existing works mainly focus on the implementation of autoencoder (AE) neural networks for CSI compression. We recommend two different methods: one based on a post training quantization and the second one in which the codebook is found during the training of the AE.
  arXiv  Detail & Related papers  (2022-07-13T08:52:13Z)
• A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
  We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
  arXiv  Detail & Related papers  (2022-05-07T03:15:15Z)
• KalmanNet: Neural Network Aided Kalman Filtering for Partially Known Dynamics [84.18625250574853]
  We present KalmanNet, a real-time state estimator that learns from data to carry out Kalman filtering under non-linear dynamics. We numerically demonstrate that KalmanNet overcomes nonlinearities and model mismatch, outperforming classic filtering methods.
  arXiv  Detail & Related papers  (2021-07-21T12:26:46Z)
• Quantum Machine Learning with SQUID [64.53556573827525]
  We present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. We provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset.
  arXiv  Detail & Related papers  (2021-04-30T21:34:11Z)
• Computing Sum of Sources over a Classical-Quantum MAC [13.561997774592664]
  We propose and analyze a coding scheme based on coset codes. The proposed technique enables the decoder recover the desired function without recovering the sources themselves. This work is based on a new ensemble of coset codes that are proven to achieve the capacity of a classical-quantum point-to-point channel.
  arXiv  Detail & Related papers  (2021-03-02T23:14:05Z)
• Dissipative Encoding of Quantum Information [0.45880283710344055]
  We explore the advantages of using Markovian evolution to prepare a quantum code in the desired logical space. We show that for stabilizer quantum codes on qubits, a finite-time dissipative encoder may always be constructed.
  arXiv  Detail & Related papers  (2021-02-08T21:07:08Z)
• Polar Codes for Quantum Reading [0.0]
  We show how to construct low complexity encoding schemes that are interesting for channel discrimination. We also show that the error probability of the scheme proposed decays exponentially with respect to the code length. An analysis of the optimal quantum states to be used as probes is given.
  arXiv  Detail & Related papers  (2020-12-14T01:24:11Z)
• Auto-Encoding Twin-Bottleneck Hashing [141.5378966676885]
  This paper proposes an efficient and adaptive code-driven graph. It is updated by decoding in the context of an auto-encoder. Experiments on benchmarked datasets clearly show the superiority of our framework over the state-of-the-art hashing methods.
  arXiv  Detail & Related papers  (2020-02-27T05:58:12Z)

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.