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:1611.09836 · Quantum Information and Computation

Pretty good state transfer between internal nodes of paths

Gabriel Coutinho, Krystal Guo, Christopher M. van Bommel

Published Aug 1, 2017• 22 citations
arXivHTMLPDF

Abstract

In this paper, we show that, for any odd prime p and positive integer t, the path on 2tp−1 vertices admits pretty good state transfer between vertices a and (n + 1 − a) for each a that is a multiple of 2t−1 with respect to the quantum walk model determined by the XY-Hamiltonian. This gives the first examples of pretty good state transfer occurring between internal vertices on an unweighted path, when it does not occur on the extremal vertices.

DOI
10.26421/qic17.9-10-5

Related papers

A complete characterization of pretty good state transfer on paths

Christopher M. van Bommel

We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If n is the length of the path, and the vertices are indexed by the positive integers from 1 to n, with adjacent vertices having consecutive indices, then the necessary and sufficient conditions for pretty good state transfer between vertices a and b are that (a) a + b = n + 1, (b) n + 1 has at most one positive odd non-trivial divisor, and (c) if n = 2^t r - 1, for r odd and r \neq 1, then a is a multiple of 2^{t - 1}.

Quantum Information and Computation•Jun 1, 2019•18 citations

A Complete Characterization of Pretty Good State Transfer on Paths

Christopher M. van Bommel

We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed by the positive integers from 1 to $n$, with adjacent vertices having consecutive indices, then the necessary and sufficient conditions for pretty good state transfer between vertices $a$ and $b$ are that (a) $a + b = n + 1$, (b) $n + 1$ has at most one odd non-trivial divisor, and (c) if $n = 2^t r - 1$, for $r$ odd and $r \neq 1$, then $a$ is a multiple of $2^{t - 1}$.

arXiv:1612.05603•Dec 16, 2016•4 citations

Quantum Walks and Pretty Good State transfer on Paths

van Bommel, Christopher Martin

Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges that needs to be resolved in order to construct a quantum computer is the transmission of information from one part of the computer to another. Quantum walks, the quantum analogues of classical random walks, provide one potential method for resolving this challenge. \n \nIn this thesis, we use techniques from algebraic graph theory and number theory to analyze the mathematical model for continuous time quantum walks on graphs. For the continuous time quantum walk model, we define a transition operator, which is a function of a Hamiltonian. We focus on the cases where the adjacency matrix or the Laplacian of a graph act as the Hamiltionian. We mainly consider quantum walks on paths as a model for spin chains, which are the underlying basis of a quantum communication protocol. \n \nFor communication to be efficient, we desire states to be transferred with high fidelity, a measure of the amount of similarity between the transmitted state and the received state. At the maximum fidelity of 1, we say we have achieved perfect state transfer. Examples of perfect state transfer are relatively rare, so the concept of pretty good state transfer was introduced as a natural relaxation, which exists if fidelities arbitrarily close to 1 are obtained. \n \nOur first main result is to characterize pretty good state transfer on paths. Previously, pretty good state transfer on paths was considered mainly for the end vertices, though results for both models indicated that if there was pretty good state transfer between the end vertices, then there was pretty good state transfer between internal vertices equidistant from each end. We complete the characterization by demonstrating, for the adjacency matrix model, a family of paths where pretty good state transfer exists between internal vertices but not between end vertices, and verifying that no other example exists. For the Laplacian model, we show that there are no paths with pretty good state transfer between internal vertices but not between the end vertices. \n \nOur second main result considers initial states involving multiple vertices. Under the adjacency matrix model, we provide necessary and sufficient conditions for pretty good state transfer in a particular family of paths in terms of the eigenvalue support of the initial state. We also discuss recent results on fractional revival, which is another form of multiple qubit state transfer.

•Aug 23, 2019•3 citations

Pretty Good State Transfer and Minimal Polynomials

Christopher M. van Bommel

We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples of simple, unweighted graphs exhibiting pretty good state transfer. Finally, we consider modifying paths by adding symmetric weighted edges, and apply these results to this case.

arXiv:2010.06779•Oct 14, 2020•2 citations

Pretty good state transfer in qubit chains—The Heisenberg Hamiltonian

Leonardo Banchi, Gabriel Coutinho, Chris D. Godsil +1 more

Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a Heisenberg chain with n qubits, there is pretty good state transfer between the nodes at the jth and (n − j + 1)th positions if n is a power of 2. Moreover, this condition is also necessary for j = 1. We obtain this result by applying a theorem due to Kronecker about Diophantine approximations, together with techniques from algebraic graph theory.

arXiv:1608.04722•Journal of Mathematical Physics•Mar 1, 2017•46 citations

Pretty good quantum state transfer via transcendental edge weights

Addison Ballif, Mark Kempton, James B. Larsen +3 more

We prove that if we take a rooted product of a circulant graph with universal perfect state transfer with a path of fixed length whose end edge is weighted with a transcendental number, then there is pretty good state transfer between any pair of endpoints of these paths. As a consequence, in a path with an even number of vertices with transcendental weights on the two edges incident to the endpoints, there is pretty good state transfer.

quant-pharXiv:2609.16549•Sep 16, 2026•0 citations
In this paper, we show that, for any odd prime p and positive integer t, the path on 2tp−1 vertices admits pretty good state transfer between vertices a and (n + 1 − a) for each a that is a multiple of 2t−1 with respect to the quantum walk model determined by the XY-Hamiltonian. This gives the first examples of pretty good state transfer occurring between internal vertices on an unweighted path, when it does not occur on the extremal vertices.
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If n is the length of the path, and the vertices are indexed by the positive integers from 1 to n, with adjacent vertices having consecutive indices, then the necessary and sufficient conditions for pretty good state transfer between vertices a and b are that (a) a + b = n + 1, (b) n + 1 has at most one positive odd non-trivial divisor, and (c) if n = 2^t r - 1, for r odd and r \neq 1, then a is a multiple of 2^{t - 1}.
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If nnn is the length of the path, and the vertices are indexed by the positive integers from 1 to nnn, with adjacent vertices having consecutive indices, then the necessary and sufficient conditions for pretty good state transfer between vertices aaa and bbb are that (a) a+b=n+1a + b = n + 1a+b=n+1, (b) n+1n + 1n+1 has at most one odd non-trivial divisor, and (c) if n=2tr−1n = 2^t r - 1n=2tr−1, for rrr odd and r≠1r \neq 1r=1, then aaa is a multiple of 2t−12^{t - 1}2t−1.
Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges that needs to be resolved in order to construct a quantum computer is the transmission of information from one part of the computer to another. Quantum walks, the quantum analogues of classical random walks, provide one potential method for resolving this challenge. \n \nIn this thesis, we use techniques from algebraic graph theory and number theory to analyze the mathematical model for continuous time quantum walks on graphs. For the continuous time quantum walk model, we define a transition operator, which is a function of a Hamiltonian. We focus on the cases where the adjacency matrix or the Laplacian of a graph act as the Hamiltionian. We mainly consider quantum walks on paths as a model for spin chains, which are the underlying basis of a quantum communication protocol. \n \nFor communication to be efficient, we desire states to be transferred with high fidelity, a measure of the amount of similarity between the transmitted state and the received state. At the maximum fidelity of 1, we say we have achieved perfect state transfer. Examples of perfect state transfer are relatively rare, so the concept of pretty good state transfer was introduced as a natural relaxation, which exists if fidelities arbitrarily close to 1 are obtained. \n \nOur first main result is to characterize pretty good state transfer on paths. Previously, pretty good state transfer on paths was considered mainly for the end vertices, though results for both models indicated that if there was pretty good state transfer between the end vertices, then there was pretty good state transfer between internal vertices equidistant from each end. We complete the characterization by demonstrating, for the adjacency matrix model, a family of paths where pretty good state transfer exists between internal vertices but not between end vertices, and verifying that no other example exists. For the Laplacian model, we show that there are no paths with pretty good state transfer between internal vertices but not between the end vertices. \n \nOur second main result considers initial states involving multiple vertices. Under the adjacency matrix model, we provide necessary and sufficient conditions for pretty good state transfer in a particular family of paths in terms of the eigenvalue support of the initial state. We also discuss recent results on fractional revival, which is another form of multiple qubit state transfer.
Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a Heisenberg chain with n qubits, there is pretty good state transfer between the nodes at the jth and (n − j + 1)th positions if n is a power of 2. Moreover, this condition is also necessary for j = 1. We obtain this result by applying a theorem due to Kronecker about Diophantine approximations, together with techniques from algebraic graph theory.