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:1007.2786 · Physical Review Letters

Perfect Quantum Routing in Regular Spin Networks

Peter J. Pemberton-Ross, Alastair Kay

Published Jan 13, 2011• 88 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.106.020503

Related papers

Perfect state transfer and efficient quantum routing: A discrete-time quantum-walk approach

Xiang Zhan, Hao Qin, Zhihao Bian +2 more

We show that a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flips and extend this method to the distribution of an arbitrary unknown multiqubit entangled state between every pair of sites in the multidimensional network. Furthermore, we study the routing of quantum information on this network in a quantum-walk architecture, which can be used as quantum information processors to communicate between separated qubits.

arXiv:1405.6422•Physical Review A•Jul 21, 2014•75 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•6 citations

Perfect transfer of arbitrary states in quantum spin networks

Matthias Christandl, Nilanjana Datta, T. C. Dorlas +3 more

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to $N$-qubit spin networks of identical qubit couplings, we show that $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{3}N$ is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).

arXiv:quant-ph/0411020•Physical Review A•Mar 14, 2005•527 citations

Quantum Internet

Savo Glisic, Beatriz Lorenzo

This chapter discusses current progress in building up a quantum internet intended to enable the transmission of quantum bits (qubits) between distant quantum devices to achieve the tasks that are impossible using classical communication. Like the classical internet, a quantum internet consists of network components like physical communication links, and eventually routers. The chapter utilizes the mathematical tools from classical routing theory for computing the latency of the routing algorithms for single source–destination pairs. It presents some numerical simulations for illustration of the performance in the case of multiple source–destination pairs. The chapter focuses on entanglement pre-sharing and routing models in more general graphs. It also presents a protocol stack model for breaking down the complexity of entanglement-based quantum networks. The focus is on the structures and architectures of quantum networks. The aim of the network is to generate arbitrary graph states between its clients on demand.

Wiley eBooks•Feb 14, 2022•0 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•39 citations

Discrete-time quantum walk approach to high-dimensional quantum state transfer and quantum routing

Hengji Li, Jian Li, Xiu‐Bo Chen

High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient routing of high-dimensional quantum states. Perfect state transfer of an arbitrary unknown qudit state can be achieved between two arbitrary nodes via a one-dimensional lackadaisical discrete-time quantum walk. In addition, this method can be generalized to the high-dimensional lattices, where it allows distillable entanglement to be shared between arbitrary input and output ports. Implementation of our scheme is more feasible through exploiting the coin degrees of freedom and the settings of the coin flipping operators are simple. These results provide a direct application in a high-dimensional computational architecture to process much more information.

arXiv:2108.04923•Aug 10, 2021•6 citations
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 show that a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flips and extend this method to the distribution of an arbitrary unknown multiqubit entangled state between every pair of sites in the multidimensional network. Furthermore, we study the routing of quantum information on this network in a quantum-walk architecture, which can be used as quantum information processors to communicate between separated qubits.
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.
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to NNN-qubit spin networks of identical qubit couplings, we show that 2log3N2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{3}N2log3​N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).
This chapter discusses current progress in building up a quantum internet intended to enable the transmission of quantum bits (qubits) between distant quantum devices to achieve the tasks that are impossible using classical communication. Like the classical internet, a quantum internet consists of network components like physical communication links, and eventually routers. The chapter utilizes the mathematical tools from classical routing theory for computing the latency of the routing algorithms for single source–destination pairs. It presents some numerical simulations for illustration of the performance in the case of multiple source–destination pairs. The chapter focuses on entanglement pre-sharing and routing models in more general graphs. It also presents a protocol stack model for breaking down the complexity of entanglement-based quantum networks. The focus is on the structures and architectures of quantum networks. The aim of the network is to generate arbitrary graph states between its clients on demand.
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.
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient routing of high-dimensional quantum states. Perfect state transfer of an arbitrary unknown qudit state can be achieved between two arbitrary nodes via a one-dimensional lackadaisical discrete-time quantum walk. In addition, this method can be generalized to the high-dimensional lattices, where it allows distillable entanglement to be shared between arbitrary input and output ports. Implementation of our scheme is more feasible through exploiting the coin degrees of freedom and the settings of the coin flipping operators are simple. These results provide a direct application in a high-dimensional computational architecture to process much more information.