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:2111.00226 · Springer proceedings in mathematics & statistics

Quantum Simulation of Perfect State Transfer on Weighted Cubelike Graphs

Jaideep Mulherkar, Rishikant Rajdeepak, V. Sunitha

Published Jan 1, 2022• 1 citation
arXivHTMLPDF
DOI
10.1007/978-981-19-9307-7_10

Related papers

Perfect state transfer in cubelike graphs

Wang-Chi Cheung, Chris D. Godsil

arXiv:1010.4721•Linear Algebra and its Applications•May 20, 2011•79 citations

Perfect edge state transfer on cubelike graphs

Xiwang Cao

arXiv:2003.10624•Quantum Information Processing•Sep 1, 2021•9 citations

Perfect state transfer on weighted graphs of the Johnson scheme

Luc Vinet, Hanmeng Zhan

arXiv:1904.08838•Letters in Mathematical Physics•Jun 17, 2020•4 citations

Quantum walk on graphs and perfect state transfer

Rachel Elizabeth Bachman, Christino Tamon

•Aug 4, 2011•0 citations

Perfect State Transfer on Weighted Abelian Cayley Graphs

Xiwang Cao, Keqin Feng, Ying-Ying Tan

Chinese Annals of Mathematics Series B•Jul 1, 2021•8 citations

Perfect State Transfer in Weighted Cubelike Graphs

Jaideep Mulherkar, Rishikant Rajdeepak, V. Sunitha

A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk is governed by the unitary operator $\mathcal{U}(t) = e^{iAt}$, where $A$ is the adjacency matrix of the graph. An important notion in the quantum random walk is the transfer of a quantum state from one vertex to another. If the fidelity of the transfer is unity, we call it a perfect state transfer. Many graph families have been shown to admit PST or periodicity, including cubelike graphs. These graphs are unweighted. In this paper, we generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs. We characterize the weights for which they admit PST or show periodicity, both at time $t=\fracπ{2}$.

arXiv:2109.12607•Sep 26, 2021•1 citation
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk is governed by the unitary operator U(t)=eiAt\mathcal{U}(t) = e^{iAt}U(t)=eiAt, where AAA is the adjacency matrix of the graph. An important notion in the quantum random walk is the transfer of a quantum state from one vertex to another. If the fidelity of the transfer is unity, we call it a perfect state transfer. Many graph families have been shown to admit PST or periodicity, including cubelike graphs. These graphs are unweighted. In this paper, we generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs. We characterize the weights for which they admit PST or show periodicity, both at time t=π2t=\fracπ{2}t=2π​.