arXiv:2004.01331 · Electronic Proceedings in Theoretical Computer Science

Growing Random Graphs with Quantum Rules

Hamza Jnane, Giuseppe Di Molfetta, Filippo M. Miatto

Published Apr 1, 2020• 0 citations

Abstract

Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more established techniques. We propose two variations of a model to grow random graphs and trees, based on continuous-time quantum walks on the graphs. After a random characteristic time, the position of the walker(s) is measured and new nodes are attached to the nodes where the walkers collapsed. Such dynamical systems are reminiscent of the class of spontaneous collapse theories in quantum mechanics. We investigate several rates of this spontaneous collapse for an individual quantum walker and for two non-interacting walkers. We conjecture (and report some numerical evidence) that the models are scale-free.

DOI: 10.4204/eptcs.315.4

Related papers

Continuous-time quantum walks on the threshold network model

YUSUKE IDE, Norio Konno

It is well known that many real world networks have a power-law degree distribution (the scale-free property). However, there are no rigorous results for continuous-time quantum walks on such realistic graphs. In this paper, we analyse the space–time behaviour of continuous-time quantum walks and random walks on the threshold network model, which is a reasonable candidate model having the scale-free property. We show that the quantum walker exhibits localisation at the starting point, although the random walker tends to spread uniformly.

arXiv:1003.0055Mathematical Structures in Computer ScienceNov 8, 20108 citations

Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks

Matheus Guedes de Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.

Jun 29, 20210 citations

Quantum random walks without walking

Kia Manouchehri, Jingbo B. Wang

Quantum random walks have received much interest due to their nonintuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable and not limited to special connectivity criteria. We present a scheme for walking on arbitrarily complex graphs, which can be realized using a variety of quantum systems such as a Bose-Einstein condensate trapped inside an optical lattice. This scheme is particularly elegant since the walker is not required to physically step between the nodes; only flipping coins is sufficient.

arXiv:0809.0034Physical Review ADec 16, 200917 citations

Bosonic Random Walk Networks for Graph Learning

Shiv Shankar Shankar, Don Towsley

The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph. Recently there has also seen tremendous progress in quantum computing techniques. In this work, we explore applications of multi-particle quantum walks on diffusing information across graphs. Our model is based on learning the operators that govern the dynamics of quantum random walkers on graphs. We demonstrate the effectiveness of our method on classification and regression tasks.

arXiv:2101.00082Dec 31, 20201 citation

Algorithmic Randomness Generation via Quantum Walks

Jincheng Zhang

The generation of true randomness remains a significant challenge in computer science, particularly when relying solely on classical algorithms. Many current approaches employ pseudo-random number generators (PRNGs), which, despite their computational efficiency, are inherently predictable and lack genuine randomness. This paper proposes a novel method for algorithmic randomness generation leveraging the principles of quantum walks. We demonstrate that the inherent uncertainty and superposition properties of quantum systems provide a robust mechanism for generating truly random numbers. Specifically, we outline a framework for designing quantum walks on graphs, where the evolution of the walker's state is fundamentally probabilistic and unpredictable. The core of our approach resides in exploiting the quantum walk's non-deterministic nature to produce sequences of numbers that exhibit statistical properties consistent with true randomness. The theoretical framework is presented, including a detailed description of the mathematical formalism underlying the quantum walk and the probability distribution of the walker's positions. We highlight the potential advantages of this approach, particularly in scenarios demanding high-quality randomness for cryptographic applications or simulations. The key concept is to translate a classical problem into a quantum one, where the inherent probabilistic nature of quantum mechanics offers a superior solution to the problem of generating genuine randomness.

Sep 7, 20260 citations

On the quantum simulation of complex networks

Duarte Magano, João P. Moutinho, Bruno Coelho Coutinho

Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links. Continuous-time quantum walk algorithms assume that we can simulate the dynamics of quantum systems where the Hamiltonian is given by the adjacency matrix of the graph. It is known that such can be simulated efficiently if the underlying graph is row-sparse and efficiently row-computable. While this is sufficient for many applications, it limits the applicability for this class of algorithms to study real world complex networks, which, among other properties, are characterized by the existence of a few densely connected nodes, called hubs. In other words, complex networks are typically not row-sparse, even though the average connectivity over all nodes can be very small. In this work, we extend the state-of-the-art results on quantum simulation to graphs that contain a small number of hubs, but that are otherwise sparse. Hopefully, our results may lead to new applications of quantum computing to network science.

arXiv:2212.06126SciPost Physics CoreAug 24, 20236 citations