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:0706.3821 · Physical Review A

Quantum Cayley networks of the hypercube

Christopher Facer, Jason Twamley, James D. Cresser

Published Jan 29, 2008• 32 citations
arXivHTMLPDF

Abstract

We develop the work of Christandl et al. [Phys. Rev. A 71, 032312 (2005)], to show how a $d$-hypercube homogenous network can be dressed by additional links to perfectly route quantum information between any given input and output nodes in a duration that is independent of the routing chosen and, surprisingly, the size of the network.

DOI
10.1103/physreva.77.012334

Related papers

Quantum networks on cubelike graphs

Anna Bernasconi, Chris D. Godsil, Simone Severini B

Cubelike graphs are the Cayley graphs of the elementary Abelian group ${\mathbb{Z}}_{2}^{n}$ (e.g., the hypercube is a cubelike graph). We study perfect state transfer between two particles in quantum networks modeled by a large class of cubelike graphs. This generalizes the results of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and Facer et al. [Phys. Rev. A 92, 187902 (2008)].

arXiv:0808.0510•Physical Review A•Nov 12, 2008•88 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

Shortcuts to quantum network routing

Eddie Schoute, Laura Mančinska, Tanvirul Islam +2 more

A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.

arXiv:1610.05238•Oct 17, 2016•160 citations

Quantum Random Walks

Swarnadeep Majumder, Austen Couvertier

The focus of this project is continuous time quantum walks (QW) on finite graphs. QW are important because they offer one route to universal quantum computation. We studied Perfect State Transfer in a variety of regular graphs, some of which have not been studied earlier. Our work has led to a method of achieving PST between any two nodes of d-dimensional hypercube graph.

•Apr 27, 2018•1 citation

A Hierarchical Entanglement Routing Protocol in Quantum Networks

C. Papachristou, Matthew Slodov, Frank Wolff

We propose a hierarchical entanglement routing protocol over the nodes of a quantum network. The objectives are to develop realistic timing parameters of entanglement operations, design the protocol procedure steps, and conduct simulations and performance evaluation. The work has applications to link layer protocols for quantum networks and the future quantum internet.

IEEE National Aerospace and Electronics Conference (NAECON)•Aug 28, 2023•1 citation

Cost and routing of CV quantum networks

Federico Centrone, Frédéric Grosshans, Valentina Parigi

We investigate the capabilities provided by highly multimode entangled quantum systems with arbitrary shapes, evaluate the cost of their experimental realization and devise an entanglement routing protocol to allow quantum communications between arbitrary nodes.

Quantum Information and Measurement (QIM)•Jan 1, 2021•0 citations
We develop the work of Christandl et al. [Phys. Rev. A 71, 032312 (2005)], to show how a ddd-hypercube homogenous network can be dressed by additional links to perfectly route quantum information between any given input and output nodes in a duration that is independent of the routing chosen and, surprisingly, the size of the network.
Cubelike graphs are the Cayley graphs of the elementary Abelian group Z2n{\mathbb{Z}}_{2}^{n}Z2n​ (e.g., the hypercube is a cubelike graph). We study perfect state transfer between two particles in quantum networks modeled by a large class of cubelike graphs. This generalizes the results of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and Facer et al. [Phys. Rev. A 92, 187902 (2008)].
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.
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.