Quantum routing in planar graph using perfect state transfer

DOI10.1007/s11128-023-04120-zarXiv2302.10074OpenAlexW4387735413MaRDI QIDQ6089494

Supriyo Dutta

Publication date: 10 November 2023

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

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

zbMATH Keywords

hypercubeperfect state transferquantum routingscalable quantum communication network

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum state transfer and network engineering
• Perfect state transfer in cubelike graphs
• Largest planar graphs of diameter two and fixed maximum degree
• Algorithms for routing in planar graphs
• A survey of the theory of hypercube graphs
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Quantum Networking
• Quantum Random Access Memory
• When can perfect state transfer occur?
• Graph minor theory
• Quantum Computation and Quantum Communication
• 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
• Gluing of graph Laplacians and their spectra
• PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS

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