Towards the World-Wide Quantum Network

Diederik Aerts, Jonito Aerts Arguëlles, Lester Beltran +5 more

Christoph Simon

Koji Azuma

If a world-wide quantum network is established only with optical devices, it leads to a cost-efficient high-speed quantum internet in the future. It is natural to imagine that such an all-optical network is composed of various protocols specialized in intracity, intercity and intercontinental quantum communication. Here I will talk about recent rapid progress on this kind of all-photonic approach towards the quantum internet.

Koji Hashimoto, Yuji Hirono, Jun Maeda +1 more

Abstract It has been proposed that random wide neural networks near Gaussian process are quantum field theories around Gaussian fixed points. In this paper, we provide a novel map with which a wide class of quantum mechanical systems can be cast into the form of a neural network with a statistical summation over network parameters. Our simple idea is to use the universal approximation theorem of neural networks to generate arbitrary paths in the Feynman’s path integral. The map can be applied to interacting quantum systems / field theories, even away from the Gaussian limit. Our findings bring machine learning closer to the quantum world.

Filippo Radicchi

The recent development of small-scale quantum networks poses the question of which network-level mechanisms could enable quantum communication to operate at scale in a future Quantum Internet. The question can be answered within a well-established framework where a quantum network is mapped into a classical weighted graph, and communication reliability is assessed using methods from network theory. Previous work relied on this framework to determine sufficient conditions for viable network-wide communication only on special network topologies, such as regular lattices, and to devise communication protocols applicable only to small- and moderate-sized real networks. Here, we overcome both limitations by introducing a family of quantum communication protocols that scale to networks with hundreds of millions of nodes. We show that the competition between increasing communication distance and path redundancy determines their large-scale behavior, and that degree heterogeneity can provide sufficient redundancy to sustain communication in small-world networks. These conclusions are supported by a systematic analysis of both real network topologies and synthetic networks, and an analytical treatment in the limit of infinitely large random scale-free graphs.

Nilesh Sharma, Saravana Vilashini M, Gopala Krishnan +6 more