Quantum reservoir computing with classical and nonclassical states in an integrated optical circuit

• URL: http://arxiv.org/abs/2603.17103v1
• Date: Tue, 17 Mar 2026 19:49:59 GMT
• Title: Quantum reservoir computing with classical and nonclassical states in an integrated optical circuit
• Abstract summary: Quantum reservoir computing (QRC) is a hardware-implementation-friendly quantum neural network scheme.<n>We use an extension of the positive-P phase space method to efficiently simulate a bosonic, linear silicon-chip based QRC system.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum reservoir computing (QRC) is a hardware-implementation-friendly quantum neural network scheme with minimal physical system requirements and a proven advantage over classical counterparts. We use an extension of the positive-P phase space method to efficiently simulate a bosonic, linear silicon-chip based QRC system excited with a single nonclassical state, a "kitten" state. In combination with input-encoding coherent states, our method allows to obtain exact results for all correlation functions without Hilbert space cutoff. Surprisingly, we find that such a setting - where the only "quantumness'' derives from a single input mode, is sufficient to obtain significant (over 9-fold) reduction of classification error over the classical counterpart. Our work provides a promising direction toward efficient quantum computation with accessible optical hardware.

Related papers

• Temporal processing of quantum states with hybrid quantum-classical reservoirs [0.5161531917413708]
  A quantum-classical hybrid architecture combines a qubit quantum reservoir with a classical echo state network (ESN)<n>We show that the hybrid system outperforms its standalone components in both linear and nonlinear tasks.<n>These results establish hybrid quantum-classical reservoir computing as a practical and scalable route for enhanced quantum machine learning on near-term qubit hardware.
  arXiv  Detail & Related papers  (2026-06-19T11:14:13Z)
• Automatic De-Quantization of Quantum Programs Using Constant Propagation [42.89658025409898]
  Every quantum operation is costly, making it crucial to minimize quantum resource usage in near-term algorithms.<n>In this work, we focus on de-quantizing quantum operations to classical computation whenever possible.<n>We formalize a hybrid state model for quantum-classical constant propagation, implement our optimizations in the open-source MQT Core tool, and evaluate them on benchmark circuits.
  arXiv  Detail & Related papers  (2026-05-21T19:21:11Z)
• Quantum-accelerated conjugate gradient methods via spectral initialization [0.0]
  A fault-tolerant quantum algorithm is used exclusively to construct a spectrally informed initial guess for a classical conjugate gradient (CG) solver.<n>A central feature of QACG is a controllable decomposition of the condition number between the quantum and the classical solver.<n>Results illustrate a concrete pathway toward the scientific and industrial use of early-stage fault-tolerant quantum computing.
  arXiv  Detail & Related papers  (2026-02-10T11:51:42Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Quantum Hyperdimensional Computing: a foundational paradigm for quantum neuromorphic architectures [0.5785414922972825]
  We introduce Quantum Hyperdimensional Computing (QHDC), a fundamentally new paradigm.<n>We demonstrate that the core operations of its classical counterpart, Hyperdimensional Computing (HDC), map with remarkable elegance and direct correspondence onto the native operations of a QC.<n>We present the first-ever implementation of this framework, validated through symbolic analogical reasoning and supervised classification tasks.
  arXiv  Detail & Related papers  (2025-11-16T16:01:56Z)
• Simulating quantum circuits with restricted quantum computers [0.0]
  This thesis is dedicated to the simulation of nonlocal quantum computation using local quantum operations.<n>We characterize the optimal simulation overhead for a broad range of practically relevant nonlocal states and channels.<n>We also investigate the utility of classical communication between the local parties.
  arXiv  Detail & Related papers  (2025-03-27T17:59:45Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58: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.