Network theory classification of quantum matter based on wave function snapshots

• URL: http://arxiv.org/abs/2512.02121v1
• Date: Mon, 01 Dec 2025 19:00:04 GMT
• Title: Network theory classification of quantum matter based on wave function snapshots
• Authors: Riccardo Andreoni, Vittorio Vitale, Cristiano Muzzi, Guido Caldarelli, Roberto Verdel, Marcello Dalmonte,
• Abstract summary: 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.<n>Our framework is of immediate experimental relevance, and can be further extended both in terms of more advanced network mathematics.
• Score: 0.0025655761752240496
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Strict advantage of complex quantum theory in a communication task [0.0]
  We investigate how the presence of complex amplitudes in quantum theory can yield operational advantages over counterpart real formulations.<n>We identify a straightforward communication task for which complex quantum theory exhibits a provably lower communication cost.<n>This substantiates a strict operational advantage of complex quantum theory.
  arXiv  Detail & Related papers  (2025-05-22T11:06:09Z)
• Emergence of global receptive fields capturing multipartite quantum correlations [0.565473932498362]
  In quantum physics, even simple data with a well-defined structure at the wave function level can be characterized by extremely complex correlations.<n>We show that monitoring the neural network weight space while learning quantum statistics allows to develop physical intuition about complex multipartite patterns.<n>Our findings suggest a fresh look at constructing convolutional neural networks for processing data with non-local patterns.
  arXiv  Detail & Related papers  (2024-08-23T12:45:40Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Highly resolved spectral functions of two-dimensional systems with neural quantum states [0.0]
  We develop a versatile approach using neural quantum states to obtain spectral properties based on simulations of excitations initially localized in real or momentum space. Our approach is broadly applicable to interacting quantum lattice models in two dimensions and opens up a route to compute spectral properties of correlated quantum matter in yet inaccessible regimes.
  arXiv  Detail & Related papers  (2023-03-14T19:00:27Z)
• Complete characterization of quantum correlations by randomized measurements [0.832184180529969]
  We provide a method to measure any locally invariant property of quantum states using locally randomized measurements. We implement these methods experimentally using pairs of entangled photons, characterizing their usefulness for quantum teleportation. Our results can be applied to various quantum computing platforms, allowing simple analysis of correlations between arbitrary distant qubits.
  arXiv  Detail & Related papers  (2022-12-15T15:22:28Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Variational classical networks for dynamics in interacting quantum matter [0.0]
  We introduce a variational class of wavefunctions based on complex networks of classical spins akin to artificial neural networks. We show that our method can be applied to any quantum many-body system with a well-defined classical limit.
  arXiv  Detail & Related papers  (2020-07-31T14:03:37Z)

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.