Pith. sign in

REVIEW 1 cited by

Pretty good state transfer between internal nodes of 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

arxiv 1611.09836 v1 pith:GSQE2VBU submitted 2016-11-29 quant-ph math.CO

classification quant-phmath.CO
keywords verticesgoodpathprettystatetransferinternalquantum
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We study a continous-time quantum walk on a path graph. In this paper, we show that, for any odd prime $p$ and positive integer $t$, the path on $2^t p - 1$ vertices admits pretty good state transfer between vertices $a$ and $n+1-a$ for each $a$ that is a multiple of $2^{t-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 a path, when it does not occur between the extremal vertices.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Designing pretty good state transfer via isospectral reductions

    quant-ph 2019-08 conditional novelty 6.0 of 10

    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...

Pith tools