REVIEW 1 cited by
A Complete Characterization of Pretty Good State Transfer on Paths
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
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}$.
Forward citations
Cited by 1 Pith paper
-
Designing pretty good state transfer via isospectral reductions
An algorithm uses isospectral reductions to extract the polynomial factors that guarantee pretty good state transfer, then tunes network parameters to satisfy them, with an extension to storing and transferring compac...
Discussion (0). Continue with ORCID to comment.