Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2512.02121

Network theory classification of quantum matter based on wave function snapshots

Riccardo Andreoni, Vittorio Vitale, Cristiano Muzzi, Guido Caldarelli, Roberto Verdel, Marcello Dalmonte

quant-phcond-mat.stat-mechcond-mat.str-elSubmitted Dec 1, 2025• Announced Dec 3, 2025• 5 citations
arXivHTMLPDF

Abstract

Quantum computers and simulators offer unparalleled capabilities of probing quantum many-body states, by obtaining snapshots of the many-body wave function via collective projective measurements. The probability distribution obtained by such snapshots (which are fundamentally limited to a negligible fraction of the Hilbert space) is of fundamental importance to determine the power of quantum computations. However, its relation to many-body collective properties is poorly understood. Here, we develop a theoretical framework to link quantum phases of matter to their snapshots, based on a combination of data complexity and network theory analyses. The first step in our scheme consists of applying Occam's razor principle to quantum sampling: given snapshots of a wave function, we identify a minimal-complexity measurement basis by analyzing the information compressibility of snapshots over different measurement bases. The second step consists of analyzing arbitrary correlations using network theory, building a wave-function network from the minimal-complexity basis data. This approach allows us to stochastically classify the output of quantum computers and simulations, with no assumptions on the underlying dynamics, and in a fully interpretable manner. We apply this method to quantum states of matter in one-dimensional translational invariant systems, where such classification is exhaustive, and where it reveals an interesting interplay between algorithmic and computational complexity for many-body states. Our framework is of immediate experimental relevance, and can be further extended both in terms of more advanced network mathematics, including discrete homology, as well as in terms of applications to physical phenomena, such as time-dependent dynamics and gauge theories.

Comments
20 pages, 8 figures

Related papers

Wave-Function Network Description and Kolmogorov Complexity of Quantum Many-Body Systems

Tiago Mendes-Santos, Markus Schmitt, Adriano Angelone +8 more

Programmable quantum devices are now able to probe wave functions at unprecedented levels. This is based on the ability to project the many-body state of atom and qubit arrays onto a measurement basis which produces snapshots of the system wave function. Extracting and processing information from such observations remains, however, an open quest. One often resorts to analyzing low-order correlation functions—that is, discarding most of the available information content. Here, we introduce wave-function networks—a mathematical framework to describe wave-function snapshots based on network theory. For many-body systems, these networks can become scale-free—a mathematical structure that has found tremendous success and applications in a broad set of fields, ranging from biology to epidemics to Internet science. We demonstrate the potential of applying these techniques to quantum science by introducing protocols to extract the Kolmogorov complexity corresponding to the output of a quantum simulator and implementing tools for fully scalable cross-platform certification based on similarity tests between networks. We demonstrate the emergence of scale-free networks analyzing experimental data obtained with a Rydberg quantum simulator manipulating up to 100 atoms. Our approach illustrates how, upon crossing a phase transition, the simulator complexity decreases while correlation length increases—a direct signature of buildup of universal behavior in data space. Comparing experiments with numerical simulations, we achieve cross-certification at the wave-function level up to timescales of 4 μs with a confidence level of 90% and determine experimental calibration intervals with unprecedented accuracy. Our framework is generically applicable to the output of quantum computers and simulators with access to the system wave function and requires probing accuracy and repetition rates accessible to most currently available platforms. Published by the American Physical Society 2024

arXiv:2301.13216•Physical Review X•May 21, 2024•30 citations

Fluctuation based interpretable analysis scheme for quantum many-body snapshots

Henning Schlömer, Annabelle Bohrdt

Microscopically understanding and classifying phases of matter is at the heart of strongly-correlated quantum physics. With quantum simulations, genuine projective measurements (snapshots) of the many-body state can be taken, which include the full information of correlations in the system. The rise of deep neural networks has made it possible to routinely solve abstract processing and classification tasks of large datasets, which can act as a guiding hand for quantum data analysis. However, though proven to be successful in differentiating between different phases of matter, conventional neural networks mostly lack interpretability on a physical footing. Here, we combine confusion learning [Nat. Phys. 13, 435 (2017)] with correlation convolutional neural networks [Nat. Commun. 12, 3905 (2021)], which yields fully interpretable phase detection in terms of correlation functions. In particular, we study thermodynamic properties of the 2D Heisenberg model, whereby the trained network is shown to pick up qualitative changes in the snapshots above and below a characteristic temperature where magnetic correlations become significantly long-range. We identify the full counting statistics of nearest neighbor spin correlations as the most important quantity for the decision process of the neural network, which go beyond averages of local observables. With access to the fluctuations of second-order correlations — which indirectly include contributions from higher order, long-range correlations — the network is able to detect changes of the specific heat and spin susceptibility, the latter being in analogy to magnetic properties of the pseudogap phase in high-temperature superconductors [Phys. Rev. Lett. 62, 957 (1989)]. By combining the confusion learning scheme with transformer neural networks, our work opens new directions in interpretable quantum image processing being sensible to long-range order.

arXiv:2304.06029•SciPost Physics•Sep 18, 2023•5 citations

TetrisCNN for interpretable detection of phases of matter from experimental quantum simulator data

Kacper Cybiński, Björn van Zwol, James Enouen +5 more

Detecting phases of matter in general relies on identifying the correct order parameter - a task that remains notoriously difficult for unknown transitions and traditionally is guided by physical intuition and educated guess. Neural networks have recently offered an alternative route by locating phase transitions in known models without any a priori physical knowledge. Yet these approaches remain black boxes and only identify phases without elucidating their properties. Moreover, they often struggle when confronted with realistic, noisy experimental data, which constitute the ultimate testbed for automated methods in physics. Here, we bridge these perspectives by introducing TetrisCNN, a convolutional architecture with parallel branches of differently shaped filters, reminiscent of Tetris blocks, that learns sparse, interpretable latent representations directly in terms of spin correlators. Applied to experimental snapshots of two-dimensional Ising and XY quantum simulators measured in multiple bases, the network not only detects phase transitions and crossovers but also expresses its latent representation and decision boundaries as symbolic formulas built from experimentally measurable spin correlators. This framework opens the way to integrating interpretable neural networks with quantum simulators to uncover and understand new phases of matter.

quant-pharXiv:2609.20693•Sep 18, 2026•0 citations

Tensor network approaches: Ground states and dynamics in quantum many-body systems

Ho N. Phien

The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.

•Jan 1, 2013•0 citations

Quantum and classical aspects of complexity in open many-body dynamics

Luca Lumia

The notion of complexity pervades physics, with manifestations rang- ing from classical networks to quantum many-body dynamics. This thesis investigates the complexity of open quantum systems, focus- ing on the interplay between unitary evolution and dissipation, with particular emphasis on measurement processes. Two complementary perspectives are developed: an approach based on quantum resource theories and a data-driven analysis of quantum trajectories. In the first part, quantum complexity is characterized in terms of resources such as entanglement, non-stabilizerness, and non-Gaussianity. These resources capture the non-classical features that enable quantum com- putational advantage. We analyze the generation of resources in mon- itored systems, where the competition between coherent dynamics and measurements gives rise to novel phase transitions. Through semiclassical analyses, tensor networks, and Gaussian and stabilizer techniques, we identify distinct dynamical regimes and clarify the interplay between different resources under repeated quantum mea- surements. The second part focuses on a classical complexity measure inspired by non-parametric machine learning methods, known as the intrinsic dimension. We employ this measure to quantify the com- plexity of ensembles of quantum trajectories, demonstrating that it is sensitive to structural properties such as integrability, fragmenta- tion, and the decoupling of correlation functions, thereby witnessing the complexity of the underlying dynamics. By combining resource- theoretic and unsupervised learning approaches, this thesis provides a wide perspective on the complexity of monitored quantum systems, bridging statistical physics, quantum information, and data science.

•Sep 22, 2025•0 citations

Data structure of synthetic quantum matter - in and out of equilibrium

Riccardo Andreoni

Analog quantum simulators natively return large collections of single-shot projective measurements, the wave-function snapshots. These are high-dimensional configurations drawn from the Born distribution of the state they prepare. These collections carry far more information than is retained when they are simply compressed into low-order observables fixed in advance. Moreover, this procedure requires knowing beforehand what one is looking for. This thesis chooses to take a different route, asking what structure a dataset of snapshots possesses as a set of points in configuration space, and what kind of physics that structure reflects. The tools used here are drawn from un supervised learning and network theory, namely principal component analysis (PCA), intrinsic-dimension estimators (TWO-NN and BID), and the wave-function networks obtained by promoting snapshots to nodes and activating links according to the met ric structure of configuration space. They are chosen under two constraints, namely interpretability at every step, and the smallest possible amount of physical input: no order parameter, no symmetry, and no knowledge of the Hamiltonian. At equilibrium, wave-function networks are used to build a classification of one dimensional quantum phases based on snapshots alone. The scheme first selects, in the spirit of Occam’s razor, the measurement basis carrying the minimal information content, and then analyses the networks constructed in that basis. Paramagnetic and symmetry-broken phases display low complexity and “probability” networks, symmetry protected topological phases high complexity and Erdős–Rényi networks, and critical points high complexity and scale-free networks. Interestingly, gapped and gapless mat ter are treated on the same footing, and real-space decimation enters the scheme to resolve massive phases rather than flowing towards criticality. Out of equilibrium, the dynamical exponent governing transport of a conserved quan tity is shown to be imprinted on the singular-value spectrum of the snapshot matrix. In particular, it is shown that the PCA entropy, and in fact the leading eigenvalue alone, grows with the same exponent as the underlying spin or energy transport, at modest system sizes, evolution times and sample numbers. Ergodicity breaking is then ad dressed through the binary intrinsic dimension (BID) of the snapshots, in the quantum sun model: the BID grows and saturates at the Thouless time, reaching its maximum in the ergodic phase, remaining system-size independent in the non-ergodic one, and growing sub-maximally at criticality, where the data occupy an extensive but lower dimensional manifold. The associated networks reproduce the equilibrium dichotomy, being random in the ergodic phase and scale-free at the transition, whose location can be identified by the BID within a few percent of spectral estimates. Preliminary experimental observations, not reported here, show analogous features. Taken together, these results indicate that datasets orders of magnitude smaller than the Hilbert-space dimension suffice to identify collective properties of quantum matter through the study of the structure of the data points in configuration space. Moreover, the same structural classes recur across ground states and quenched dynamics, with no order parameter supplied and under realistic experimental imperfections. The final chapter elaborates on another aspect of quantum simulator capabilities, that is, that to realize gauge theory dynamics. There, one-dimensional U(1) lattice gauge theories with a topological θ term are mapped exactly onto kinetically con strained fermions in an emergent Stark potential. The mapping accounts for the slow relaxation reported in recent Rydberg experiments: prethermalization near an inte grable point at θ = 0, and Stark localization with Hilbert-space fragmentation at θ ̸ =0.

•Sep 25, 2026•0 citations
Quantum computers and simulators offer unparalleled capabilities of probing quantum many-body states, by obtaining snapshots of the many-body wave function via collective projective measurements. The probability distribution obtained by such snapshots (which are fundamentally limited to a negligible fraction of the Hilbert space) is of fundamental importance to determine the power of quantum computations. However, its relation to many-body collective properties is poorly understood. Here, we develop a theoretical framework to link quantum phases of matter to their snapshots, based on a combination of data complexity and network theory analyses. The first step in our scheme consists of applying Occam's razor principle to quantum sampling: given snapshots of a wave function, we identify a minimal-complexity measurement basis by analyzing the information compressibility of snapshots over different measurement bases. The second step consists of analyzing arbitrary correlations using network theory, building a wave-function network from the minimal-complexity basis data. This approach allows us to stochastically classify the output of quantum computers and simulations, with no assumptions on the underlying dynamics, and in a fully interpretable manner. We apply this method to quantum states of matter in one-dimensional translational invariant systems, where such classification is exhaustive, and where it reveals an interesting interplay between algorithmic and computational complexity for many-body states. Our framework is of immediate experimental relevance, and can be further extended both in terms of more advanced network mathematics, including discrete homology, as well as in terms of applications to physical phenomena, such as time-dependent dynamics and gauge theories.
Programmable quantum devices are now able to probe wave functions at unprecedented levels. This is based on the ability to project the many-body state of atom and qubit arrays onto a measurement basis which produces snapshots of the system wave function. Extracting and processing information from such observations remains, however, an open quest. One often resorts to analyzing low-order correlation functions—that is, discarding most of the available information content. Here, we introduce wave-function networks—a mathematical framework to describe wave-function snapshots based on network theory. For many-body systems, these networks can become scale-free—a mathematical structure that has found tremendous success and applications in a broad set of fields, ranging from biology to epidemics to Internet science. We demonstrate the potential of applying these techniques to quantum science by introducing protocols to extract the Kolmogorov complexity corresponding to the output of a quantum simulator and implementing tools for fully scalable cross-platform certification based on similarity tests between networks. We demonstrate the emergence of scale-free networks analyzing experimental data obtained with a Rydberg quantum simulator manipulating up to 100 atoms. Our approach illustrates how, upon crossing a phase transition, the simulator complexity decreases while correlation length increases—a direct signature of buildup of universal behavior in data space. Comparing experiments with numerical simulations, we achieve cross-certification at the wave-function level up to timescales of 4 μs with a confidence level of 90% and determine experimental calibration intervals with unprecedented accuracy. Our framework is generically applicable to the output of quantum computers and simulators with access to the system wave function and requires probing accuracy and repetition rates accessible to most currently available platforms. Published by the American Physical Society 2024
Microscopically understanding and classifying phases of matter is at the heart of strongly-correlated quantum physics. With quantum simulations, genuine projective measurements (snapshots) of the many-body state can be taken, which include the full information of correlations in the system. The rise of deep neural networks has made it possible to routinely solve abstract processing and classification tasks of large datasets, which can act as a guiding hand for quantum data analysis. However, though proven to be successful in differentiating between different phases of matter, conventional neural networks mostly lack interpretability on a physical footing. Here, we combine confusion learning [Nat. Phys. 13, 435 (2017)] with correlation convolutional neural networks [Nat. Commun. 12, 3905 (2021)], which yields fully interpretable phase detection in terms of correlation functions. In particular, we study thermodynamic properties of the 2D Heisenberg model, whereby the trained network is shown to pick up qualitative changes in the snapshots above and below a characteristic temperature where magnetic correlations become significantly long-range. We identify the full counting statistics of nearest neighbor spin correlations as the most important quantity for the decision process of the neural network, which go beyond averages of local observables. With access to the fluctuations of second-order correlations — which indirectly include contributions from higher order, long-range correlations — the network is able to detect changes of the specific heat and spin susceptibility, the latter being in analogy to magnetic properties of the pseudogap phase in high-temperature superconductors [Phys. Rev. Lett. 62, 957 (1989)]. By combining the confusion learning scheme with transformer neural networks, our work opens new directions in interpretable quantum image processing being sensible to long-range order.
Detecting phases of matter in general relies on identifying the correct order parameter - a task that remains notoriously difficult for unknown transitions and traditionally is guided by physical intuition and educated guess. Neural networks have recently offered an alternative route by locating phase transitions in known models without any a priori physical knowledge. Yet these approaches remain black boxes and only identify phases without elucidating their properties. Moreover, they often struggle when confronted with realistic, noisy experimental data, which constitute the ultimate testbed for automated methods in physics. Here, we bridge these perspectives by introducing TetrisCNN, a convolutional architecture with parallel branches of differently shaped filters, reminiscent of Tetris blocks, that learns sparse, interpretable latent representations directly in terms of spin correlators. Applied to experimental snapshots of two-dimensional Ising and XY quantum simulators measured in multiple bases, the network not only detects phase transitions and crossovers but also expresses its latent representation and decision boundaries as symbolic formulas built from experimentally measurable spin correlators. This framework opens the way to integrating interpretable neural networks with quantum simulators to uncover and understand new phases of matter.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.
The notion of complexity pervades physics, with manifestations rang- ing from classical networks to quantum many-body dynamics. This thesis investigates the complexity of open quantum systems, focus- ing on the interplay between unitary evolution and dissipation, with particular emphasis on measurement processes. Two complementary perspectives are developed: an approach based on quantum resource theories and a data-driven analysis of quantum trajectories. In the first part, quantum complexity is characterized in terms of resources such as entanglement, non-stabilizerness, and non-Gaussianity. These resources capture the non-classical features that enable quantum com- putational advantage. We analyze the generation of resources in mon- itored systems, where the competition between coherent dynamics and measurements gives rise to novel phase transitions. Through semiclassical analyses, tensor networks, and Gaussian and stabilizer techniques, we identify distinct dynamical regimes and clarify the interplay between different resources under repeated quantum mea- surements. The second part focuses on a classical complexity measure inspired by non-parametric machine learning methods, known as the intrinsic dimension. We employ this measure to quantify the com- plexity of ensembles of quantum trajectories, demonstrating that it is sensitive to structural properties such as integrability, fragmenta- tion, and the decoupling of correlation functions, thereby witnessing the complexity of the underlying dynamics. By combining resource- theoretic and unsupervised learning approaches, this thesis provides a wide perspective on the complexity of monitored quantum systems, bridging statistical physics, quantum information, and data science.
Analog quantum simulators natively return large collections of single-shot projective measurements, the wave-function snapshots. These are high-dimensional configurations drawn from the Born distribution of the state they prepare. These collections carry far more information than is retained when they are simply compressed into low-order observables fixed in advance. Moreover, this procedure requires knowing beforehand what one is looking for. This thesis chooses to take a different route, asking what structure a dataset of snapshots possesses as a set of points in configuration space, and what kind of physics that structure reflects. The tools used here are drawn from un supervised learning and network theory, namely principal component analysis (PCA), intrinsic-dimension estimators (TWO-NN and BID), and the wave-function networks obtained by promoting snapshots to nodes and activating links according to the met ric structure of configuration space. They are chosen under two constraints, namely interpretability at every step, and the smallest possible amount of physical input: no order parameter, no symmetry, and no knowledge of the Hamiltonian. At equilibrium, wave-function networks are used to build a classification of one dimensional quantum phases based on snapshots alone. The scheme first selects, in the spirit of Occam’s razor, the measurement basis carrying the minimal information content, and then analyses the networks constructed in that basis. Paramagnetic and symmetry-broken phases display low complexity and “probability” networks, symmetry protected topological phases high complexity and Erdős–Rényi networks, and critical points high complexity and scale-free networks. Interestingly, gapped and gapless mat ter are treated on the same footing, and real-space decimation enters the scheme to resolve massive phases rather than flowing towards criticality. Out of equilibrium, the dynamical exponent governing transport of a conserved quan tity is shown to be imprinted on the singular-value spectrum of the snapshot matrix. In particular, it is shown that the PCA entropy, and in fact the leading eigenvalue alone, grows with the same exponent as the underlying spin or energy transport, at modest system sizes, evolution times and sample numbers. Ergodicity breaking is then ad dressed through the binary intrinsic dimension (BID) of the snapshots, in the quantum sun model: the BID grows and saturates at the Thouless time, reaching its maximum in the ergodic phase, remaining system-size independent in the non-ergodic one, and growing sub-maximally at criticality, where the data occupy an extensive but lower dimensional manifold. The associated networks reproduce the equilibrium dichotomy, being random in the ergodic phase and scale-free at the transition, whose location can be identified by the BID within a few percent of spectral estimates. Preliminary experimental observations, not reported here, show analogous features. Taken together, these results indicate that datasets orders of magnitude smaller than the Hilbert-space dimension suffice to identify collective properties of quantum matter through the study of the structure of the data points in configuration space. Moreover, the same structural classes recur across ground states and quenched dynamics, with no order parameter supplied and under realistic experimental imperfections. The final chapter elaborates on another aspect of quantum simulator capabilities, that is, that to realize gauge theory dynamics. There, one-dimensional U(1) lattice gauge theories with a topological θ term are mapped exactly onto kinetically con strained fermions in an emergent Stark potential. The mapping accounts for the slow relaxation reported in recent Rydberg experiments: prethermalization near an inte grable point at θ = 0, and Stark localization with Hilbert-space fragmentation at θ ̸ =0.