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:2201.02720 · Journal of Algebraic Combinatorics

Quantum state transfer between twins in weighted graphs

Steve Kirkland, Hermie Monterde, Sarah Plosker

Published Oct 2, 2023• 9 citations
arXivHTMLPDF
DOI
10.1007/s10801-023-01261-3

Related papers

Quantum Simulation of Perfect State Transfer on Weighted Cubelike Graphs

Jaideep Mulherkar, Rishikant Rajdeepak, V. Sunitha

arXiv:2111.00226•Springer proceedings in mathematics & statistics•Jan 1, 2022•0 citations

Quantum state transfer in graphs with tails

Pierre-Antoine Bernard, Christino Tamon, Luc Vinet +1 more

arXiv:2211.14704•Linear Algebra and its Applications•Feb 4, 2025•2 citations

Quantum walks on finite and bounded infinite graphs

Chris D. Godsil, Steve Kirkland, Mohapatra, Sarojini +2 more

A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable partitions of bounded weighted graphs with twin subgraphs and use this fact to construct finite and bounded infinite graphs with pair and plus state transfer with the adjacency matrix as a Hamiltonian. We show that for each $k \ge 3$, (i) there are infinitely many connected unweighted graphs with maximum degree $k$ admitting pair state transfer at $τ\in\{\fracπ{\sqrt{2}},\fracπ{2}\}$, and (ii) there are infinitely many signed graphs with exactly one negative edge weight and whose underlying unweighted graphs have maximum degree $k$ admitting plus state transfer at $τ\in\{\fracπ{\sqrt{2}},\fracπ{2}\}$. Parallel results are proven for perfect state transfer between a plus state and a pair state, and for the existence of sedentary pair and plus states. We further prove that almost all connected unweighted finite planar graphs admit pair state transfer at $τ\in\{\fracπ{\sqrt{2}},\fracπ{2}\}$, and almost all connected unweighted finite planar graphs can be assigned a single negative edge weight resulting in plus state transfer, or perfect state transfer between a plus state and a pair state, at $τ\in\{\fracπ{\sqrt{2}},\fracπ{2}\}$. Analogous results are shown to hold for unweighted finite trees. Using blow-up graphs, Cayley graphs and graphs with tails, we construct new infinite families of (finite and infinite) unweighted graphs and signed graphs admitting pair or plus state transfer.

arXiv:2510.05306•Oct 6, 2025•0 citations

Strong quantum state transfer on graphs via loop edges

Gábor Lippner, Yujia Shi

We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for any graph where this protocol is feasible. By considering local spectral symmetry, we show that the required weight size depends only on the maximum degree of the graph and, in some less favorable cases, the distance between vertices. Additionally, we explore the duration for which transfer strength remains above a specified threshold.

arXiv:2404.01173•Linear Algebra and its Applications•Oct 10, 2024•0 citations

Constructing graphs having Laplacian pair state transfer by an edge perturbation

Wei Wang, Xiaogang Liu, Jing Wang

In this paper, we give some sufficient conditions for graphs with an edge perturbation between twin vertices to have Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer. By those sufficient conditions, we also construct many new graphs having Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer.

arXiv:2202.04957•Feb 10, 2022•0 citations

Quantum State Transfer on Neighborhood Corona of Two Graphs

Xiaoqin Zhang, Qi Xiong, Gui‐Xian Tian +1 more

arXiv:2204.08722•Bulletin of the Malaysian Mathematical Sciences Society•Nov 22, 2022•5 citations
A weighted graph GGG with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in GGG. In this paper, we prove a fundamental result on equitable partitions of bounded weighted graphs with twin subgraphs and use this fact to construct finite and bounded infinite graphs with pair and plus state transfer with the adjacency matrix as a Hamiltonian. We show that for each k≥3k \ge 3k≥3, (i) there are infinitely many connected unweighted graphs with maximum degree kkk admitting pair state transfer at τ∈{π2,π2}τ\in\{\fracπ{\sqrt{2}},\fracπ{2}\}τ∈{2​π​,2π​}, and (ii) there are infinitely many signed graphs with exactly one negative edge weight and whose underlying unweighted graphs have maximum degree kkk admitting plus state transfer at τ∈{π2,π2}τ\in\{\fracπ{\sqrt{2}},\fracπ{2}\}τ∈{2​π​,2π​}. Parallel results are proven for perfect state transfer between a plus state and a pair state, and for the existence of sedentary pair and plus states. We further prove that almost all connected unweighted finite planar graphs admit pair state transfer at τ∈{π2,π2}τ\in\{\fracπ{\sqrt{2}},\fracπ{2}\}τ∈{2​π​,2π​}, and almost all connected unweighted finite planar graphs can be assigned a single negative edge weight resulting in plus state transfer, or perfect state transfer between a plus state and a pair state, at τ∈{π2,π2}τ\in\{\fracπ{\sqrt{2}},\fracπ{2}\}τ∈{2​π​,2π​}. Analogous results are shown to hold for unweighted finite trees. Using blow-up graphs, Cayley graphs and graphs with tails, we construct new infinite families of (finite and infinite) unweighted graphs and signed graphs admitting pair or plus state transfer.
We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for any graph where this protocol is feasible. By considering local spectral symmetry, we show that the required weight size depends only on the maximum degree of the graph and, in some less favorable cases, the distance between vertices. Additionally, we explore the duration for which transfer strength remains above a specified threshold.