Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2403.05623 · Quantum

Transfer and routing of Gaussian states through quantum complex networks with and without community structure

Markku Hahto, Johannes Nokkala, Guillermo García-Pérez, Sabrina Maniscalco, Jyrki Piilo

Published May 20, 2025• 0 citations
arXivHTMLPDF

Abstract

The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another. A less known generalization of state transfer considers multiple systems such that any pair can exchange quantum information and transfers can take place at any time, starting and stopping independently. This is sometimes called routing of quantum states. State transfer in particular has received a great deal of attention, however the vast majority of results in both state transfer and routing concern qubits transferred in a network of restricted structure. Here we consider routing of single-mode Gaussian states and entanglement through complex networks of quantum harmonic oscillators. We compare a protocol where the transfer is completed in a single step but the effective Hamiltonian only approximately transfers the state with one where the transfer can in principle be perfect but the transfer is done in two steps, and also illustrate the state-dependency of the transfer fidelity. We find that even in a random and homogeneous network, the transfer fidelity still depends on the degree of the nodes for any link density, and that in both random and complex networks it is the community structure that controls the appearance of higher frequency normal modes useful for transfer. Finally, we find that networks of sufficient complexity may have superior routing performance over superficially similar random networks. Our results pave the way for further exploration of the role of community structure in state transfer and related tasks.

DOI
10.22331/q-2025-05-20-1751

Related papers

State Transfer in Noisy Modular Quantum Networks

Markku Hahto, Jyrki Piilo, Johannes Nokkala

Abstract Quantum state transfer is the act of transferring quantum information from one system in a quantum network to another without physically transporting carriers of quantum information, but instead engineering a Hamiltonian such that the state of the sender is transferred to the receiver through the dynamics of the whole network. A generalization of quantum state transfer called quantum routing concerns simultaneous transfers between multiple pairs in a quantum network, imposing limitations on its structure. This study considers transfer of Gaussian states over noisy quantum networks with modular structure, which have been identified as a suitable platform for quantum routing. Two noise models are compared, affecting either the network topology or the network constituents, studying their effects on both the transfer fidelities and the network properties. The two models are found to affect different features of the network allowing for the identification and quantification of the noise. These features are then used as a guide toward different strategies for the compensation of the noise, and to examine how the compensation strategies perform. The results show that in general, modular networks are more robust to noise than monolithic ones.

arXiv:2407.02145•Advanced Quantum Technologies•Oct 4, 2024•1 citation

Perfect Quantum Routing in Regular Spin Networks

Peter J. Pemberton-Ross, Alastair Kay

Motivated by the need for quantum computers to communicate between multiple, well separated qubits, we introduce the task of quantum routing for distributing quantum states, and generating entanglement, between these sites. We describe regular families of coupled quantum networks which perfectly route qubits between arbitrary pairs of nodes with a high transmission rate. The ability to route multiple states simultaneously and the regularity of the networks vastly improve the utility of this scheme in comparison to the task of state transfer, leading us to propose an implementation in optical lattices.

arXiv:1007.2786•Physical Review Letters•Jan 13, 2011•81 citations

Parallel State Transfer and Efficient Quantum Routing on Quantum Networks

Christopher Chudzicki, Frederick W. Strauch

We study the routing of quantum information in parallel on multidimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits. We show that perfect parallel state transfer is possible for certain networks of harmonic oscillator modes. We extend this to the distribution of entanglement between every pair of nodes in the network, finding that the routing efficiency of hypercube networks is optimal and robust in the presence of dissipation and finite bandwidth.

arXiv:1008.1806•Physical Review Letters•Dec 22, 2010•40 citations

Demonstration of a photonic router via quantum walks

Huixia Gao, Kunkun Wang, Dengke Qu +2 more

Abstract Motivated by the need for quantum computers to communicate between multiple, well separated qubits, we introduce the task of routing the quantum state from one input mode to a superposition of several output modes coherently. We report an experimental demonstration of a deterministic photonic routing protocol applied to an entangled state. We show in a quantum walk architecture, quantum networks perfectly route entangled states from an initial input mode to an arbitrary output mode coherently and deterministically. Our results demonstrate the key principle of a perfect router, opening a route toward data routing and transferring for quantum computing systems. The routing algorithm in our work can be applied to a wide range of physical systems, which provides a way for effective design of efficient routing protocols on practical quantum networks.

New Journal of Physics•May 1, 2023•5 citations

Quantum network routing via link prediction

Antal Száva

A network of devices capable of transmitting quantum information called a quantum network has promising applications with vast benefits. One of the most near term achievable application is the quantum key distribution. It could be used for sharing a secret key between two end-users through any insecure authenticated communication channel. Other than sharing a secret key, a quantum network can be used for connecting quantum computers. Quantum computers have the potential to solve computational problems that their classical counterparts would require significantly more time to do so. By connecting such devices, distributed computation problems such as leader election or distributed consensus between nodes can be solved securely. For such applications to be put into practice on a large scale, there are open practical questions still to be answered. In a quantum network, a data qubit containing quantum information is transmitted by an operation called quantum teleportation. For it, two nodes need to share entanglement. Quantum teleportation then ensures the safe transmission of a qubit by using the shared entanglement and the exchange of two classical bits. This operation, however, consumes entanglement between the nodes, changing the network topology with each served request. In quantum networks, certain nodes share entanglement between each other. Routing in quantum networks entails determining which of these shared entanglements are used to transmit quantum information. As this proves to be a difficult task, we study quantum networks and in particular consider the problem of routing entanglement in quantum networks. The average latency for routing entanglement in a quantum network has been studied so far using a distributed routing approach. Thus, we present numerical simulation results of centralised routing for the average latency of demands in two existing entanglement generation models. In the first, shared entanglement between nodes is created on-demand. In the second, certain nodes pre-share entanglement before the demand comes. Our results show the intuition that using a centralised routing approach in the on-demand model results in drastically more average latency than in the model with pre-shared entanglement. Since some nodes might not be informed about the change in topology, we study the effect of the propagation of information about the network topology to nodes in the network. Our observations based on simulation results show that the average latency is significantly higher if the information about the topology is not propagated well in the network. As propagating information to all nodes in a network would be a significant load for the network, we consider information propagation within a radius and still observe a considerable decrease in average latency. At last, we present a technique called link prediction which can be performed by any node without the need for information propagation and still achieve a considerable decrease in average latency. It can be effectively used to predict the change of topology in a quantum network by using knowledge about the network topology for a certain future point in time and previous knowledge about the network traffic.

•Jan 1, 2019•0 citations

Scalable Structure for Chiral Quantum Routing

Giovanni Ragazzi, Simone Cavazzoni, Claudia Benedetti +2 more

We address the problem of routing quantum and classical information from one sender to many possible receivers in a network. By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete graph, where the sites naturally provide a basis for encoding the quantum state to be transmitted. Upon tuning a single phase or weight in the Hamiltonian, we achieve near-unitary routing fidelity, enabling the selective delivery of information to designated receivers for both classical and quantum data. The structure is inherently scalable, accommodating an arbitrary number of receivers. The routing time is largely independent of the network's dimension and input state, and the routing performance is robust under static and dynamic noise, at least for a short time.

arXiv:2502.12739•Entropy•May 5, 2025•3 citations
The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another. A less known generalization of state transfer considers multiple systems such that any pair can exchange quantum information and transfers can take place at any time, starting and stopping independently. This is sometimes called routing of quantum states. State transfer in particular has received a great deal of attention, however the vast majority of results in both state transfer and routing concern qubits transferred in a network of restricted structure. Here we consider routing of single-mode Gaussian states and entanglement through complex networks of quantum harmonic oscillators. We compare a protocol where the transfer is completed in a single step but the effective Hamiltonian only approximately transfers the state with one where the transfer can in principle be perfect but the transfer is done in two steps, and also illustrate the state-dependency of the transfer fidelity. We find that even in a random and homogeneous network, the transfer fidelity still depends on the degree of the nodes for any link density, and that in both random and complex networks it is the community structure that controls the appearance of higher frequency normal modes useful for transfer. Finally, we find that networks of sufficient complexity may have superior routing performance over superficially similar random networks. Our results pave the way for further exploration of the role of community structure in state transfer and related tasks.
Abstract Quantum state transfer is the act of transferring quantum information from one system in a quantum network to another without physically transporting carriers of quantum information, but instead engineering a Hamiltonian such that the state of the sender is transferred to the receiver through the dynamics of the whole network. A generalization of quantum state transfer called quantum routing concerns simultaneous transfers between multiple pairs in a quantum network, imposing limitations on its structure. This study considers transfer of Gaussian states over noisy quantum networks with modular structure, which have been identified as a suitable platform for quantum routing. Two noise models are compared, affecting either the network topology or the network constituents, studying their effects on both the transfer fidelities and the network properties. The two models are found to affect different features of the network allowing for the identification and quantification of the noise. These features are then used as a guide toward different strategies for the compensation of the noise, and to examine how the compensation strategies perform. The results show that in general, modular networks are more robust to noise than monolithic ones.
Motivated by the need for quantum computers to communicate between multiple, well separated qubits, we introduce the task of quantum routing for distributing quantum states, and generating entanglement, between these sites. We describe regular families of coupled quantum networks which perfectly route qubits between arbitrary pairs of nodes with a high transmission rate. The ability to route multiple states simultaneously and the regularity of the networks vastly improve the utility of this scheme in comparison to the task of state transfer, leading us to propose an implementation in optical lattices.
We study the routing of quantum information in parallel on multidimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits. We show that perfect parallel state transfer is possible for certain networks of harmonic oscillator modes. We extend this to the distribution of entanglement between every pair of nodes in the network, finding that the routing efficiency of hypercube networks is optimal and robust in the presence of dissipation and finite bandwidth.
Abstract Motivated by the need for quantum computers to communicate between multiple, well separated qubits, we introduce the task of routing the quantum state from one input mode to a superposition of several output modes coherently. We report an experimental demonstration of a deterministic photonic routing protocol applied to an entangled state. We show in a quantum walk architecture, quantum networks perfectly route entangled states from an initial input mode to an arbitrary output mode coherently and deterministically. Our results demonstrate the key principle of a perfect router, opening a route toward data routing and transferring for quantum computing systems. The routing algorithm in our work can be applied to a wide range of physical systems, which provides a way for effective design of efficient routing protocols on practical quantum networks.
A network of devices capable of transmitting quantum information called a quantum network has promising applications with vast benefits. One of the most near term achievable application is the quantum key distribution. It could be used for sharing a secret key between two end-users through any insecure authenticated communication channel. Other than sharing a secret key, a quantum network can be used for connecting quantum computers. Quantum computers have the potential to solve computational problems that their classical counterparts would require significantly more time to do so. By connecting such devices, distributed computation problems such as leader election or distributed consensus between nodes can be solved securely. For such applications to be put into practice on a large scale, there are open practical questions still to be answered. In a quantum network, a data qubit containing quantum information is transmitted by an operation called quantum teleportation. For it, two nodes need to share entanglement. Quantum teleportation then ensures the safe transmission of a qubit by using the shared entanglement and the exchange of two classical bits. This operation, however, consumes entanglement between the nodes, changing the network topology with each served request. In quantum networks, certain nodes share entanglement between each other. Routing in quantum networks entails determining which of these shared entanglements are used to transmit quantum information. As this proves to be a difficult task, we study quantum networks and in particular consider the problem of routing entanglement in quantum networks. The average latency for routing entanglement in a quantum network has been studied so far using a distributed routing approach. Thus, we present numerical simulation results of centralised routing for the average latency of demands in two existing entanglement generation models. In the first, shared entanglement between nodes is created on-demand. In the second, certain nodes pre-share entanglement before the demand comes. Our results show the intuition that using a centralised routing approach in the on-demand model results in drastically more average latency than in the model with pre-shared entanglement. Since some nodes might not be informed about the change in topology, we study the effect of the propagation of information about the network topology to nodes in the network. Our observations based on simulation results show that the average latency is significantly higher if the information about the topology is not propagated well in the network. As propagating information to all nodes in a network would be a significant load for the network, we consider information propagation within a radius and still observe a considerable decrease in average latency. At last, we present a technique called link prediction which can be performed by any node without the need for information propagation and still achieve a considerable decrease in average latency. It can be effectively used to predict the change of topology in a quantum network by using knowledge about the network topology for a certain future point in time and previous knowledge about the network traffic.
We address the problem of routing quantum and classical information from one sender to many possible receivers in a network. By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete graph, where the sites naturally provide a basis for encoding the quantum state to be transmitted. Upon tuning a single phase or weight in the Hamiltonian, we achieve near-unitary routing fidelity, enabling the selective delivery of information to designated receivers for both classical and quantum data. The structure is inherently scalable, accommodating an arbitrary number of receivers. The routing time is largely independent of the network's dimension and input state, and the routing performance is robust under static and dynamic noise, at least for a short time.