Searcharxiv⌕ Search

arXiv subjects

Giovanni Cemin

Publications and source records attributed to Giovanni Cemin.

4 recordsLinked to original sources

Learning to stabilize nonequilibrium phases of matter with active feedback using partial information

Recent advances in quantum computing experiments have enabled new pathways for feedback control. Here, we investigate the role of information in interactive quantum many-body dynamics to engineer out-of-equilibrium phases of matter. To this end, we train reinforcement learning agents to prevent entanglement spreading in (1+1)-dimensional stabilizer circuits with up to 128 qubits. We find that, above an information threshold, agents learn stochastic near-optimal strategies that prevent the system from reaching volume-law entangled states and instead stabilize area-law scaling. These strategies rely on bottlenecks that divide the system and cap the entanglement in the steady state. Crucially, learned strategies are inherently out of equilibrium, require real-time active feedback, and could not be reproduced by simple human-designed control rules. This work establishes the foundations for information-driven individual control of many interacting quantum degrees of freedom, demonstrating the capabilities of reinforcement learning to stabilize and uncover novel critical properties of many-body nonequilibrium steady states.

quant-ph↗

Error correction and quantum information spreading on sparse random graphs

Quantum error-correcting codes on graph geometries beyond regular euclidean lattices have emerged as a promising route toward robust quantum information processing. A major challenge in quantum error correction is the trade-off between favorable properties of codes constructed in high dimensionality and the need for locality in practical implementations on near-term hardware. Sparse intermediate geometries may combine the advantages of both, but how their structure governs quantum information dynamics and code performance remains unclear. Here we show that the spectral dimension $d_s$, defined from the low-energy spectrum of the graph Laplacian, is the universal parameter connecting these properties. Using Floquet random Clifford circuits on two distinct sparse graph architectures with tunable spectral dimension, we find that $d_s$ governs both quantum information spreading and the scaling of the resulting quantum error-correcting code distance. We identify a geometry-induced entanglement phase transition from localized area-law to ergodic volume-law, whose universality is determined by $d_s$ and exhibits long-range percolation criticality. In the ergodic phase, the circuit acts as a CSS code encoder whose code distance is set by the competition between two logical sectors --- the cost of severing the graph and the length of its shortest winding cycle --- which connectivity pushes in opposite directions. The spectral dimension organizes this trade-off, highlighting a maximum at intermediate $d_s$ retaining sparse connectivity and physical realizability.

quant-ph↗

Machine learning of quantum channels on NISQ devices

World-wide efforts aim at the realization of advanced quantum simulators and processors. However, despite the development of intricate hardware and pulse control systems, it may still not be generally known which effective quantum dynamics, or channels, are implemented on these devices. To systematically infer those, we propose a neural-network algorithm approximating generic discrete-time dynamics through the repeated action of an effective quantum channel. We test our approach considering time-periodic Lindblad dynamics as well as non-unitary subsystem dynamics in many-body unitary circuits. Moreover, we exploit it to investigate cross-talk effects on the ibmq_ehningen quantum processor, which showcases our method as a practically applicable tool for inferring quantum channels when the exact nature of the underlying dynamics on the physical device is not known a priori. While the present approach is tailored for learning Markovian dynamics, we discuss how it can be adapted to also capture generic non-Markovian discrete-time evolutions.

quant-ph↗

Inferring interpretable dynamical generators of local quantum observables from projective measurements through machine learning

To characterize the dynamical behavior of many-body quantum systems, one is usually interested in the evolution of so-called order-parameters rather than in characterizing the full quantum state. In many situations, these quantities coincide with the expectation value of local observables, such as the magnetization or the particle density. In experiment, however, these expectation values can only be obtained with a finite degree of accuracy due to the effects of the projection noise. Here, we utilize a machine-learning approach to infer the dynamical generator governing the evolution of local observables in a many-body system from noisy data. To benchmark our method, we consider a variant of the quantum Ising model and generate synthetic experimental data, containing the results of $N$ projective measurements at $M$ sampling points in time, using the time-evolving block-decimation algorithm. As we show, across a wide range of parameters the dynamical generator of local observables can be approximated by a Markovian quantum master equation. Our method is not only useful for extracting effective dynamical generators from many-body systems, but may also be applied for inferring decoherence mechanisms of quantum simulation and computing platforms.

quant-ph↗