SearcharxivSearch

arXiv subjects

Roberta Zambrini

Publications and source records attributed to Roberta Zambrini.

At least 19 recordsLinked to original sources

Unraveling-Dependent Metastability in Monitored Quantum Systems and Associative Memories

Metastability in open quantum systems is usually inferred from spectral separation in the Liouvillian, which governs unconditional, ensemble-averaged dynamics. We show that this diagnosis is incomplete at the level of individual quantum trajectories: conditioned realizations of the same unconditional dynamics can bypass, transiently access, or operationally preserve a metastable memory, depending on the monitored channel and the observed record. We demonstrate these mechanisms in a driven-dissipative nonlinear oscillator realizing a quantum associative memory, by comparing spectra, target fidelities, and phase-space distributions. The non-Hermitian dynamics obtained by post-selecting on the absence of detected events supports metastable retrieval, but with a distinct long-time fate: normalization selects the least-decaying mode of the non-Hermitian spectrum rather than the addressed memory branch. In contrast, stochastic jump trajectories can preserve retrieval over extended times when the post-measurement update remains compatible with the coherent memory structure. Thus trajectory-level metastability is not determined by the averaged generator alone; it requires compatibility between the monitored channel, the measurement record, and the metastable manifold.

quant-ph

Energetic Cost of Temporal Information Processing in Quantum Reservoirs

Quantum reservoir computing offers a promising route toward energy-efficient machine learning by processing temporal information with minimal training overhead. Yet, the physical principles linking its energetic cost to computational performance remain largely unexplored. Here we show that, in an interacting spin reservoir, information encoding and information processing are governed by distinct physical mechanisms. In the weak interacting regime, we derive an analytical expression for the average (switching) work, showing that the energetic cost of encoding new inputs is determined by the local response of the reservoir units. In contrast, interactions primarily redistribute the encoded information, generating memory and nonlinear features while only weakly affecting the work. This separation produces opposite correlations between energetic cost and performance for representative linear and nonlinear benchmark tasks. Our results identify the switching work as the energetic signature of information encoding and clarify when energetic efficiency and computational performance are compatible.

quant-ph

Storage, Scrambling, and Loss of Information in the Quantum Reservoir Computing Paradigm

The suitability of a quantum reservoir computing (QRC) platform for a given time-series processing task is closely tied to the dynamical properties of its computational substrate and design. Information is injected into, processed by, and read from this substrate, and finally passed to a linear readout layer which is trained to perform a specific task. In this work we introduce a classical-quantum state derived from the process tensor representing the dynamical part of this process for typical QRC protocols found in the literature. Using this object, mutual informations between physical subsystems and subsets of past inputs can be written as Holevo quantities, which we then use to numerically investigate information saturation in the substrate, fading memory of past inputs, and the local accessibility of injected information for a commonly used QRC platform. We then extract two diagnostics that characterise the nonlocal scrambling of information within, and loss of information from the substrate, and compare these to QRC performance across Hamiltonian parameters and measurement strengths. Finally, we comment on future directions that the framework introduced here opens up for the study and extension of the QRC program.

quant-ph

Dissipation in Periodically Driven Quantum Systems: Partial Secularization and Thermodynamic Consistency

Periodically driven open quantum systems are central to quantum thermodynamics and quantum control. These systems are typically described using Floquet-Born-Markov master equations, derived with the use of a full secular approximation, and whose thermodynamic implications are often overlooked. In this context, we show that such a strong secular approximation may lead to unphysical predictions for steady state energy currents. We then demonstrate that a coarse-grained formulation of the master equation can regularize these issues while yielding completely positive dynamics and consistent energy currents. The coarse-graining time has a clear physical interpretation, as it defines the temporal resolution at which a Markovian master equation can describe the evolution of the periodically driven system. We show the consistency and validity of our approach by comparing to an exact non-Markovian simulation in paradigmatic examples: a driven two-level system and a three-level maser coupled to hot and cold thermal reservoirs. Our work provides a practical framework for correctly applying the secular approximation in periodically driven-dissipative systems and for assessing the accuracy of master equations of the GKSL form.

quant-ph

Quantum Synchronization

Natural and engineered classical systems are replete with examples of synchronization, understood as the adjustment of rhythms of physical systems. Such synchronization is at the heart of the stability of several classical technologies, such as mechanical bridges and electrical networks. Given the advent of quantum simulation and computation technologies, it is natural to study a quantum analogue of synchronization and explore novel applications. This review surveys synchronization in few and many-body quantum systems, measures that quantify them, and their applications to quantum technologies.

quant-ph

General theory of monitored Quantum Reservoir Computing

Quantum reservoir computing (QRC) provides a powerful framework for processing temporal data using quantum dynamics, but incorporating measurements into the reservoir remains a fundamental challenge and distinctive feature with respect to classical settings. The induced back-action can vary from a source of disturbance to a computational resource, as measurement deeply modifies the dynamics underlying temporal processing. Existing approaches have treated specific monitoring schemes independently, missing the common physical principles governing online quantum reservoirs. Here we develop a general theory of monitored quantum reservoir computing based on indirect quantum measurements, which unifies projective, weak, partial, and dissipative monitoring protocols within a single operational framework. Measurement back-action can serve as a controllable resource, providing the effective dissipation and non-unital dynamics required for successful QRC, even when the underlying unmonitored evolution is unsuitable. We derive general criteria under which monitored dynamics satisfy the echo-state property, fading memory, and input separability, including a necessary and sufficient condition for emergent strict contractivity. By comparing different monitoring schemes under a common reference dynamics, we show that these protocols are not interchangeable parameterizations to be optimized for peak performance, but rather constitute qualitatively distinct routes to computational capability, each enabled by the interplay between information extraction and measurement-induced disturbance -- a trade-off that can be further shaped through time multiplexing. Our results provide a unified theoretical foundation for online monitored quantum reservoir computing and establish quantum measurement engineering as a systematic approach for designing reservoir architectures across different quantum platforms.

quant-ph

Temporal processing of quantum states with hybrid quantum-classical reservoirs

A distinctive feature of Quantum Reservoir Computing (QRC) is the ability to directly embed quantum input states into the reservoir dynamics. However, the resulting output is fundamentally linear for a single input state, preventing QRC from naturally computing nonlinear functionals such as purity or entropy. We overcome this limitation with a quantum-classical hybrid architecture combining a qubit quantum reservoir with a classical echo state network (ESN), allowing both nonlinear functional approximation and effective temporal processing. We systematically study performance under two information regimes: full-tomography and partial information (single-axis measurements), with the latter demonstrating that the hybrid system outperforms its standalone components in both linear and nonlinear tasks due to the enhanced information retrieval provided by the quantum reservoir. Building on these results, we apply an online monitoring protocol that explicitly accounts for measurement back-action and finite measurement ensembles, enabling a realistic assessment of performance under experimental conditions. These results establish hybrid quantum-classical reservoir computing (HRC) architectures as a practical and scalable route for enhanced quantum machine learning on near-term qubit hardware.

quant-ph

Benchmarking Quantum Extreme Learning based on Gaussian Boson Sampling

Reservoir models offer a hardware-efficient learning paradigm for noisy intermediate-scale quantum devices by exploiting untrained quantum dynamics as a fixed feature map and restricting optimization to a simple classical readout layer. We propose a quantum extreme learning machine implemented using gaussian boson sampling and an encoding strategy that achieves high classification accuracy while reducing optical resource requirements. Classical inputs are jointly encoded in the squeezing parameters and in the interferometer unitary, enabling sampling-based, highly nonlinear feature maps while leveraging large-scale GBS output statistics, which are conjectured to be classically intractable. We systematically compare multiple families of quantum features accessible in the same setup and find that photon-number sampling probabilities provide the best performance, consistent with their higher effective feature dimensionality. Finally, we benchmark against classical nonlinear baselines and analyse robustness under noisy scenarios, showing competitive performance with fewer trainable parameters and indicating practical promise for near-term photonic implementations.

quant-ph

Learning functions of quantum states with distributed architectures

Distributed architectures are gaining prominence in quantum machine learning as a means to overcome hardware limitations and enable scalable quantum information processing. In this context, we analyze the design and performance of distributed Quantum Extreme Learning Machine (QELM) architectures for learning functions of quantum states directly from data, restricting measurements to easily implementable projective measurements in the computational basis. The aim is to determine which schemes can effectively recover specific properties of input quantum states, including both linear and nonlinear features, while also quantifying the resource requirements in terms of measurements and reservoir dimensionality. We compare standard three-layer QELM with a spatially multiplexed architecture composed of multiple independent three-layer units for linear (quantum) tasks, showing a linear reduction in resource requirements per unit. For nonlinear properties, the study examines the multiple-injection architecture and introduces a novel distributed design that incorporates entanglement between subsystems within a spatially multiplexed framework, evaluating its performance through the reconstruction of complex nonlinear quantities such as polynomial targets, R\'enyi entropy, and entanglement measures. Our results demonstrate that the distributed design enables the reconstruction of higher-order nonlinearities by increasing the number of interacting subsystems with reduced resources, rather than increasing the size of an individual reservoir, providing a scalable and hardware-efficient route to quantum property learning.

quant-ph

Quantum reservoir computing in Jaynes-Cummings models: Nonlinear memory and time-series prediction

We investigate quantum reservoir computing (QRC) using a hybrid qubit-boson system described by the Jaynes-Cummings (JC) Hamiltonian and its dispersive limit (DJC). These models provide high-dimensional Hilbert spaces and intrinsic nonlinear dynamics, making them powerful substrates for temporal information processing. We systematically benchmark both reservoirs through linear and nonlinear memory tasks, demonstrating that they exhibit an unusual superior nonlinear over linear memory capacity. We further test their predictive performance on the Mackey-Glass time series, a widely used benchmark for chaotic dynamics, and show comparable forecasting ability. We also investigate how memory and prediction accuracy vary with reservoir parameters, and show the role of higher-order bosonic observables and time multiplexing in enhancing expressivity, even in minimal spin-boson configurations. Our results establish JC- and DJC-based reservoirs as versatile platforms for time-series processing and as elementary units that overcome the setting of equivalent qubit pairs and offer pathways toward tunable, high-performance quantum machine learning architectures.

quant-ph

Experimental memory control in continuous variable optical quantum reservoir computing

Quantum reservoir computing (QRC) offers a promising framework for online quantum-enhanced machine learning tailored to temporal tasks, yet practical implementations with native memory capabilities remain limited. Here, we demonstrate an optical QRC platform based on deterministically generated multimode squeezed states, exploiting both spectral and temporal multiplexing in a fully continuous-variable (CV) setting, and enabling controlled fading memory. Data is encoded via programmable phase shaping of the pump in an optical parametric process and retrieved through mode-selective homodyne detection. Real-time memory is achieved through feedback using electro-optic phase modulation, while long-term dependencies are achieved via spatial multiplexing. This architecture with minimal post-processing performs nonlinear temporal tasks, including parity checking and chaotic signal forecasting, with results corroborated by a high-fidelity Digital Twin. We show that leveraging the entangled multimode structure significantly enhances the expressivity and memory capacity of the quantum reservoir. This work establishes a scalable photonic platform for quantum machine learning, operating in CV encoding and supporting practical quantum-enhanced information processing.

quant-ph

Exponential concentration and symmetries in Quantum Reservoir Computing

Quantum reservoir computing (QRC) is an emerging framework for near-term quantum machine learning that offers in-memory processing, platform versatility across analogue and digital systems, and avoids typical trainability challenges such as barren plateaus and local minima. The exponential number of independent features of quantum reservoirs opens the way to a potential performance improvement compared to classical settings. However, this exponential scaling can be hindered by exponential concentration, where finite-ensemble noise in quantum measurements requires exponentially many samples to extract meaningful outputs, a common issue in quantum machine learning. In this work, we go beyond static quantum machine learning tasks and address concentration in QRC for time-series processing using quantum-scrambling reservoirs. Beyond discussing how concentration effects can constrain QRC performance, we demonstrate that leveraging Hamiltonian symmetries significantly suppresses concentration, enabling robust and scalable QRC implementations. We illustrate our approach with concrete examples, including an established QRC design.

quant-ph

Non-Markovianity and memory enhancement in Quantum Reservoir Computing

Featuring memory of past inputs is a fundamental requirement for machine learning models processing time-dependent data. In quantum reservoir computing, all architectures proposed so far rely on Markovian dynamics, which, as we prove, inherently lead to an exponential decay of past information, thereby limiting long-term memory capabilities. We demonstrate that non-Markovian dynamics can overcome this limitation, enabling extended memory retention. By analytically deriving memory bounds and supporting our findings with numerical simulations, we show that non-Markovian reservoirs can outperform their Markovian counterparts, particularly in tasks that require a coexistence of short- and long-term correlations. We introduce an embedding approach that allows a controlled transition from Markovian to non-Markovian evolution, providing a path for practical implementations. Our results establish quantum non-Markovianity as a key resource for enhancing memory in quantum machine learning architectures, with broad implications in quantum neural networks.

quant-ph

Unveiling hidden features of the Kitaev model through a complex-network analysis

We introduce a density matrix-based network analysis to explore the ground state of the Kitaev chain, uncovering previously hidden structural and entanglement features. This approach successfully identifies the critical point associated with the topological phase transition and reveals a singular point where the ground state exhibits uniform, nonzero entanglement between all fermion pairs, corresponding to a fully connected network structure. We provide an analytical explanation for this singular behavior and establish a connection to the concept of ground state factorization observed in spin chains. Moreover, we analyze the open chain scenario and observe characteristic symmetry changes in the ground state corresponding to Majorana zero modes. While complex network theory has been employed in the study of quantum systems before, we demonstrate that it can uncover fundamentally new physical insights.

quant-ph

Liouvillian skin effect in quantum neural networks

In the field of dissipative systems, the non-Hermitian skin effect has generated significant interest due to its unexpected implications. A system is said to exhibit a skin effect if its properties are largely affected by the boundary conditions. Despite the burgeoning interest, the potential impact of this phenomenon on emerging quantum technologies remains unexplored. In this work, we address this gap by demonstrating that quantum neural networks can exhibit this behavior and that skin effects, beyond their fundamental interest, can also be exploited in computational tasks. Specifically, we show that the performance of a given complex network used as a quantum reservoir computer is dictated solely by the boundary conditions of a dissipative line within its architecture. The closure of one (edge) link is found to drastically change the performance in time-series processing, proving the possibility of exploiting skin effects for machine learning.

quant-ph

Retrieving past quantum features with deep hybrid classical-quantum reservoir computing

Machine learning techniques have achieved impressive results in recent years and the possibility of harnessing the power of quantum physics opens new promising avenues to speed up classical learning methods. Rather than viewing classical and quantum approaches as exclusive alternatives, their integration into hybrid designs has gathered increasing interest, as seen in variational quantum algorithms, quantum circuit learning, and kernel methods. Here we introduce deep hybrid classical-quantum reservoir computing for temporal processing of quantum states where information about, for instance, the entanglement or the purity of past input states can be extracted via a single-step measurement. We find that the hybrid setup cascading two reservoirs not only inherits the strengths of both of its constituents but is even more than just the sum of its parts, outperforming comparable non-hybrid alternatives. The quantum layer is within reach of state-of-the-art multimode quantum optical platforms while the classical layer can be implemented in silico.

quant-ph

Quantum reservoir computing in atomic lattices

Quantum reservoir computing (QRC) exploits the dynamical properties of quantum systems to perform machine learning tasks. We demonstrate that optimal performance in QRC can be achieved without relying on disordered systems. Systems with all-to-all topologies and random couplings are generally considered to minimize redundancies and enhance performance. In contrast, our work investigates the one-dimensional Bose-Hubbard model with homogeneous couplings, where a chaotic phase arises from the interplay between coupling and interaction terms. Interestingly, we find that performance in different tasks can be enhanced either in the chaotic regime or in the weak interaction limit. Our findings challenge conventional design principles and indicate the potential for simpler and more efficient QRC implementations tailored to specific tasks in Bose-Hubbard lattices.

quant-ph

Quantum machine learning via continuous-variable cluster states and teleportation

A new approach suitable for distributed quantum machine learning and exhibiting memory is proposed for a photonic platform. This measurement-based quantum reservoir computing takes advantage of continuous variable cluster states as the main quantum resource. Cluster states are key to several photonic quantum technologies, enabling universal quantum computing as well as quantum communication protocols. The proposed measurement-based quantum reservoir computing is based on a neural network of cluster states and local operations, where input data are encoded through measurement, thanks to quantum teleportation. In this design, measurements enable input injections, information processing and continuous monitoring for time series processing. The architecture's power and versatility are tested by performing a set of benchmark tasks showing that the protocol displays internal memory and is suitable for both static and temporal information processing without hardware modifications. This design opens the way to distributed machine learning.

quant-ph