Related papers: Quantum Network Models and Classical Localization …
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…
Quantum advantage is well-established in centralized computing, where quantum algorithms can solve certain problems exponentially faster than classical ones. In the distributed setting, significant progress has been made in…
The study of toy models in loop quantum gravity (LQG), defined as truncations of the full theory, is relevant to both the development of the LQG phenomenology, in cosmology and astrophysics, and the progress towards the resolution of the…
The design of the Quantum Internet protocol stack is at its infancy and early-stage conceptualization. And different heterogeneous proposals are currently available in the literature. The underlying assumption of the existing proposals is…
The statistics of S-matrix fluctuations are numerically investigated on a model for irregular quantum scattering in which a classical chaotic diffusion takes place within the interaction region. Agreement with various random-matrix…
Network coordination is considered in three basic settings, characterizing the generation of separable and classical-quantum correlations among multiple parties. First, we consider the simulation of a classical-quantum state between two…
This paper is concerned with the analysis of linear quantum optical networks. It provides a systematic approach to the construction a model for a given quantum network in terms of a system of quantum stochastic differential equations. This…
In quantum information theory there is a construction for quantum channels, appropriately called a quantum graph, that generalizes the confusability graph construction for classical channels in classical information theory. In this paper,…
We study the disorder-induced localisation transition in a three-dimensional network model that belongs to symmetry class C. The model represents quasiparticle dynamics in a gapless spin-singlet superconductor without time-reversal…
We explore the use of machine-learning techniques to detect quantum speedup in random walks on graphs. Specifically, we investigate the performance of three different neural-network architectures (variations on fully connected and…
We investigate the problem of the superuniversality of the phase transition between different quantum Hall plateaus. We construct a set of models which give a qualitative description of this transition in a pure system of interacting…
Large-scale communication networks, such as the internet, rely on routing packets of data through multiple intermediate nodes to transmit information from a sender to a receiver. In this paper, we develop a model of a quantum communication…
Three-dimensional quantum percolation problems are studied by analyzing energy level statistics of electrons on maximally connected percolating clusters. The quantum percolation threshold $\pq$, which is larger than the classical…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
The study of real-life network modeling has become very popular in recent years. An attractive model is the scale-free percolation model on the lattice $\mathbb{Z}^d$, $d\ge1$, because it fulfills several stylized facts observed in large…
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
We analyze an idealized model for the transmission or flow of particles, or discrete packets of information, in a weight bearing branching hierarchical 2-D networks, and its variants. The capacities add hierarchically down the clusters.…
We present a comprehensive comparison of spin and energy dynamics in quantum and classical spin models on different geometries, ranging from one-dimensional chains, over quasi-one-dimensional ladders, to two-dimensional square lattices.…
Quantum computing is currently gaining significant attention, not only from the academic community but also from industry, due to its potential applications across several fields for addressing complex problems. For any practical problem…