Quantum routing in planar graph using perfect state transfer

DOI10.1007/S11128-023-04120-ZarXiv2302.10074OpenAlexW4387735413MaRDI QIDQ6089494FDOQ6089494

Authors: Supriyo Dutta 

Publication date: 10 November 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: In this article, we consider a spin-spin interaction network governed by $XX+YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off any interaction, that assists us to perform multiple perfect state transfers in a graph simultaneously. We also build up a salable network allowing quantum communication between two arbitrary vertices. Later we utilize the combinatorial characteristics of hypercube graphs to propose a static routing schema to communicate simultaneously between a set of senders and a set of receivers in a planar network. Our construction is new and significantly powerful. We elaborate multiple examples of planar graphs supporting quantum routing where classical routing is not possible.

Full work available at URL: https://arxiv.org/abs/2302.10074

Recommendations

• Perfect quantum state transfer using Hadamard diagonalizable graphs
• QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
• Quantum state transfer on a class of circulant graphs
• On the qubit routing problem
• Perfect state transfer on quotient graphs
• Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
• Perfect state transfer in cubelike graphs
• Perfect state transfer on \(\gcd\)-graphs
• Perfect state transfer on oriented graphs
• Quantum state transfer on the complete bipartite graph

zbMATH Keywords

hypercubeperfect state transferquantum routingscalable quantum communication network

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• When can perfect state transfer occur?
• Perfect state transfer in cubelike graphs
• Largest planar graphs of diameter two and fixed maximum degree
• A survey of the theory of hypercube graphs
• The physical implementation of quantum computation.
• Graph minor theory
• Title not available (Why is that?)
• No Laplacian perfect state transfer in trees
• COMMUNICATION IN XYZ ALL-TO-ALL QUANTUM NETWORKS WITH A MISSING LINK
• Efficient Message Routing in Planar Networks
• PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
• Quantum random access memory
• Quantum state transfer and network engineering
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Algorithms for routing in planar graphs
• Quantum networking
• Quantum Computation and Quantum Communication
• Gluing of graph Laplacians and their spectra

Cited In (3)

• Title not available (Why is that?)
• High-fidelity state transfer via quantum walks from delocalized states
• Non-Markovianity in discrete-time open quantum random walk on arbitrary graphs

This page was built for publication: Quantum routing in planar graph using perfect state transfer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089494)