Quantum state transfer on the complete bipartite graph

DOI10.1088/1751-8121/AC5217MaRDI QIDQ5049979zbMATH OpenOpenAlexFDO

Authors R. A. M. Santos

Publication date 14 November 2022

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

zbMATH Keywords

coined quantum walkscomplete bipartite graphlackadaisical quantum walksquantum state transfer

Mathematics Subject Classification ID

Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum equilibrium statistical mechanics (general) (82B10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• A high-fidelity quantum state transfer algorithm on the complete bipartite graph
• Quantum state transfer on a class of circulant graphs
• Perfect state transfer on quotient graphs
• Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
• QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
• Perfect state transfer on \(\gcd\)-graphs
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Quantum state transfer on neighborhood corona of two graphs
• Perfect state transfer in NEPS of complete graphs
• Perfect quantum state transfer on Cayley graphs over semi-dihedral groups

Cites work

• An infinite family of circulant graphs with perfect state transfer in discrete quantum walks
• Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
• Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk
• Quantum walks and search algorithms
• Qubit state transfer via discrete-time quantum walks

Cited in

(10)

• Pretty good quantum state transfer in asymmetric graphs via potential
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
• QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
• COMMUNICATION IN XYZ ALL-TO-ALL QUANTUM NETWORKS WITH A MISSING LINK
• Stimulated Raman adiabatic passage-like protocols for amplitude transfer generalize to many bipartite graphs
• Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk
• Qubit state transfer via discrete-time quantum walks
• Quantum routing in planar graph using perfect state transfer
• A high-fidelity quantum state transfer algorithm on the complete bipartite graph

This page was built for publication: Quantum state transfer on the complete bipartite graph

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