Quantum random networks

D.S. Wiersma

Shantanav Chakraborty, Kyle Luh, Jérémie Roland

The fundamental problem of sampling from the limiting distribution of quantum walks on networks, known as mixing, finds widespread applications in several areas of quantum information and computation. Of particular interest in most of these applications is the minimum time beyond which the instantaneous probability distribution of the quantum walk remains close to this limiting distribution, known as the "quantum mixing time". However, this quantity is only known for a handful of specific networks. In this Letter, we prove an upper bound on the quantum mixing time for almost all networks, i.e., the fraction of networks for which our bound holds, goes to one in the asymptotic limit. To this end, using several results in random matrix theory, we find the quantum mixing time of Erdös-Renyi random networks: networks of n nodes where each edge exists with probability p independently. For example, for dense random networks, where p is a constant, we show that the quantum mixing time is O(n^{3/2+o(1)}). In addition to opening avenues for the analytical study of quantum dynamics on random networks, our work could find applications beyond quantum information processing. Owing to the universality of Wigner random matrices, our results on the spectral properties of random graphs hold for general classes of random matrices that are ubiquitous in several areas of physics. In particular, our results could lead to novel insights into the equilibration times of isolated quantum systems defined by random Hamiltonians, a foundational problem in quantum statistical mechanics.

Lijun Xia, Xuemei Gu, Kai Wang +5 more

Understanding how complex connectivity emerges in networks is a fundamental challenge in classical and quantum science. In classical random networks, complex subgraphs typically require relatively high connection probabilities, whereas quantum random network theory predicts that such structures can arise at a single, lower threshold through entanglement and local operations. Here, using an integrated silicon photonic chip, we experimentally realize a quantum subgraph predicted by quantum random network theory in a four-node quantum random network. Our integrated platform exploits probabilistic photon-pair sources and coherent control of path modes to prepare a structured quantum subgraph through local transformations and postselection, operating in a threshold regime that differs from classical random networks. We verify that the subgraph state exhibits genuine high-dimensional multipartite entanglement across the nodes, providing experimental evidence that quantum entanglement enables connectivity structures beyond classical accessibility.

Josef Honerkamp

Josef Honerkamp

Esteban Macías, Ilya A. Gruzberg, Eldad Bettelheim

We solve the problem of the spin quantum Hall transition on random networks using a mapping to classical percolation that focuses on the boundary of percolating clusters. Using tools of two-dimensional quantum gravity, we compute critical exponents that characterize this transition and confirm that these are related to the exponents for the regular (square) network through the KPZ relation. Our results demonstrate the relevance of the geometric randomness of the networks and support conclusions of numerical simulations of random networks for the integer quantum Hall transition.