Scientific Reports

A recurrent Gaussian quantum network for online processing of quantum time series

Robbe De Prins, Guy Van der Sande, Peter Bienstman

Published May 29, 2024• 2 citations

Abstract

Over the last decade, researchers have studied the interplay between quantum computing and classical machine learning algorithms. However, measurements often disturb or destroy quantum states, requiring multiple repetitions of data processing to estimate observable values. In particular, this prevents online (real-time, single-shot) processing of temporal data as measurements are commonly performed during intermediate stages. Recently, it was proposed to sidestep this issue by focusing on tasks with quantum output, eliminating the need for detectors. Inspired by reservoir computers, a model was proposed where only a subset of the internal parameters are trained while keeping the others fixed at random values. Here, we also process quantum time series, but we do so using a Recurrent Gaussian Quantum Network (RGQN) of which all internal interactions can be trained. As expected, this increased flexibility yields higher performance in benchmark tasks. Building on this, we show that the RGQN can tackle two quantum communication tasks, while also removing some hardware restrictions of the currently available methods. First, our approach is more resource efficient to enhance the transmission rate of quantum channels that experience certain memory effects. Second, it can counteract similar memory effects if they are unwanted, a task that could previously only be solved when redundantly encoded input signals could be provided. Finally, we run a small-scale version of the last task on Xanadu's photonic processor Borealis.

DOI: 10.1038/s41598-024-61004-7

Related papers

A Quantum Optical Recurrent Neural Network for Online Processing of Quantum Times Series

Robbe De Prins, Guy Van der Sande, Peter Bienstman

Over the last decade, researchers have studied the synergy between quantum computing (QC) and classical machine learning (ML) algorithms. However, measurements in QC often disturb or destroy quantum states, requiring multiple repetitions of data processing to estimate observable values. In particular, this prevents online (i.e., real-time, single-shot) processing of temporal data as measurements are commonly performed during intermediate stages. Recently, it was proposed to sidestep this issue by focusing on tasks with quantum output, thereby removing the need for detectors. Inspired by reservoir computers, a model was proposed where only a subset of the internal parameters are optimized while keeping the others fixed at random values. Here, we also process quantum time series, but we do so using a quantum optical recurrent neural network (QORNN) of which all internal interactions can be trained. As expected, this approach yields higher performance, as long as training the QORNN is feasible. We further show that our model can enhance the transmission rate of quantum channels that experience certain memory effects. Moreover, it can counteract similar memory effects if they are unwanted, a task that could previously only be solved when redundantly encoded input signals were available. Finally, we run a small-scale version of this last task on the photonic processor Borealis, demonstrating that our QORNN can be constructed using currently existing hardware.

arXiv:2306.00134May 31, 20231 citation

Online quantum time series processing with random oscillator networks

Johannes Nokkala

Reservoir computing is a powerful machine learning paradigm for online time series processing. It has reached state-of-the-art performance in tasks such as chaotic time series prediction and continuous speech recognition thanks to its unique combination of high computational power and low training cost which sets it aside from alternatives such as traditionally trained recurrent neural networks, and furthermore is amenable to implementations in dedicated hardware, potentially leading to extremely compact and efficient reservoir computers. Recently the use of random quantum systems has been proposed, leveraging the complexity of quantum dynamics for classical time series processing. Extracting the output from a quantum system without disturbing its state too much is problematic however, and can be expected to become a bottleneck in such approaches. Here we propose a reservoir computing inspired approach to online processing of time series consisting of quantum information, sidestepping the measurement problem. We illustrate its power by generalizing two paradigmatic benchmark tasks from classical reservoir computing to quantum information and introducing a task without a classical analogue where a random system is trained to both create and distribute entanglement between systems that never directly interact. Finally, we discuss partial generalizations where only the input or only the output time series is quantum.

arXiv:2108.00698Scientific ReportsMay 11, 202313 citations

Reservoir Computing via Quantum Recurrent Neural Networks

Samuel Yen-Chi Chen, Daniel Fry, Deshmukh, Amol +2 more

Recent developments in quantum computing and machine learning have propelled the interdisciplinary study of quantum machine learning. Sequential modeling is an important task with high scientific and commercial value. Existing VQC or QNN-based methods require significant computational resources to perform the gradient-based optimization of a larger number of quantum circuit parameters. The major drawback is that such quantum gradient calculation requires a large amount of circuit evaluation, posing challenges in current near-term quantum hardware and simulation software. In this work, we approach sequential modeling by applying a reservoir computing (RC) framework to quantum recurrent neural networks (QRNN-RC) that are based on classical RNN, LSTM and GRU. The main idea to this RC approach is that the QRNN with randomly initialized weights is treated as a dynamical system and only the final classical linear layer is trained. Our numerical simulations show that the QRNN-RC can reach results comparable to fully trained QRNN models for several function approximation and time series prediction tasks. Since the QRNN training complexity is significantly reduced, the proposed model trains notably faster. In this work we also compare to corresponding classical RNN-based RC implementations and show that the quantum version learns faster by requiring fewer training epochs in most cases. Our results demonstrate a new possibility to utilize quantum neural network for sequential modeling with greater quantum hardware efficiency, an important design consideration for noisy intermediate-scale quantum (NISQ) computers.

arXiv:2211.02612Nov 4, 20229 citations

Time-series quantum reservoir computing with weak and projective measurements

Pere Mujal, Rodrigo Martínez‐Peña, Gian Luca Giorgi +2 more

Abstract Time-series processing is a major challenge in machine learning with enormous progress in the last years in tasks such as speech recognition and chaotic series prediction. A promising avenue for sequential data analysis is quantum machine learning, with computational models like quantum neural networks and reservoir computing. An open question is how to efficiently include quantum measurement in realistic protocols while retaining the needed processing memory and preserving the quantum advantage offered by large Hilbert spaces. In this work, we propose different measurement protocols and assess their efficiency in terms of resources, through theoretical predictions and numerical analysis. We show that it is possible to exploit the quantumness of the reservoir and to obtain ideal performance both for memory and forecasting tasks with two successful measurement protocols. One repeats part of the experiment after each projective measurement while the other employs weak measurements operating online at the trade-off where information can be extracted accurately and without hindering the needed memory, in spite of back-action effects. Our work establishes the conditions for efficient time-series processing paving the way to its implementation in different quantum technologies.

arXiv:2205.06809npj Quantum InformationFeb 23, 202392 citations

Recurrent Quantum Feature Maps for Reservoir Computing

Utkarsh Singh, Aaron Z. Goldberg, Christoph Simon +1 more

Reservoir computing promises a fast method for handling large amounts of temporal data. This hinges on constructing a good reservoir--a dynamical system capable of transforming inputs into a high-dimensional representation while remembering properties of earlier data. In this work, 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. 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, including echo state networks and multilayer perceptrons, while maintaining compact circuit depth and qubit requirements. We further analyze memory capacity and show that the model effectively retains temporal information, consistent with its forecasting accuracy. Finally, we study the impact of realistic noise and find that performance is robust to several noise channels but remains sensitive to two-qubit gate errors, identifying a key limitation for near-term implementations.

quant-pharXiv:2604.03469Apr 7, 20260 citations

Machine Learning using Quantum Light

Jorge García‐Beni

[eng] Quantum photonic technologies have achieved considerable success across a range of disciplines, including quantum computing, quantum communications, and quantum metrology. Conversely, in the current era of information, the ability to discern patterns within voluminous data sets is highly sought after, with Machine Learning (ML) having emerged as a powerful solution to address this challenge. The processing speed of photonic hardware, in conjunction with the potential for computation enhancement resulting from quantum properties, positions quantum photonics as a promising platform for the implementation of ML algorithms. In this thesis, we focus on reservoir computing (RC) as an ML framework that is suitable for time series processing. It provides fast and energy-efficient training in comparison to more conventional methods and is also appropriate for physical implementations. In this thesis, we explore the possibilities brought by quantum photonic setups in the field of quantum RC. Specifically, we propose and study different platform designs that are able to perform different temporal benchmark tasks by providing tunable memory and nonlinearity. Furthermore, we leverage the capabilities of state-of-the-art quantum photonic hardware and identify novel strategies to address key challenges in RC in quantum substrates, as well as expand the potential of quantum machine learning. Firstly, an approach is provided to overcome some of the limitations of quantum projective measurements, thereby enabling information processing in real time. This is achieved by generating a physical ensemble of quantum reservoirs that recirculate through an optical fiber inside a feedback loop. We investigate the detrimental effects of sampling noise due to finite ensembles and provide a strategy to mitigate them. Secondly, the consequences of increasing quantum squeezing in the dynamics of such setups were studied, and it was found that it monotonically improves the noise robustness of the platforms in realistic scenarios. Finally, we propose a novel design in which photonic cluster states, a specific kind of highly entangled quantum network, are used as resources to implement quantum RC. In this configuration, external input information is encoded into the quantum network via quantum teleportation by engineering the measurement basis of the protocol. Furthermore, the platform has the capacity to implement global quantum gates through local operations (single-mode measurements), thus establishing the foundation for distributed quantum ML.

Jan 1, 20260 citations