DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication
Artículo científico (JournalArticle)
Wave-function network description and Kolmogorov complexity of quantum many-body systems
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 in situ access to the system wave function and requires probing accuracy and repetition rates accessible to most currently available platforms., The work of M. D. and A. A. was partially supported by the ERC under Grant No. 758329 (AGEnTh), and by the MIUR Programme FARE (MEPH). M. D. further acknowledges funding within the QuantERA II Programme that
has received funding from the European Union’s Horizon 2020 research and innovation programme under Grant Agreement No. 101017733. D. B. acknowledges support from MCIN/AEI/10.13039/501100011033 (RYC2018-025348-I and NextGenerationEU PRTR-C17.I1). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 853443). Moreover, the authors gratefully acknowledge the Gauss Centre for Supercomputing e.V. for funding this project by providing computing time through the John von Neumann Institute for Computing (NIC) on the GCS Supercomputer JUWELS at Jülich Supercomputing Centre
(JSC). This work is supported by the European Union’s Horizon 2020 research and innovation program under
Grant Agreement No. 817482 (PASQuanS), the Agence Nationale de la Recherche (ANR, project RYBOTIN),
and the European Research Council (Advanced Grant No. 101018511-ATARAXIA). M. S. has received support
by Helmholtz Initiative and Networking Fund, Grant No. VH-NG-1711., Peer reviewed