2018/02/05 by Steve Kirkland, Kirkland, Steve, Sarah Plosker +3
Computer Science · Mathematics · Physics and Astronomy · #05C50 #15A18 #81Q10 #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Neural Networks and Reservoir Computing #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #math.CO #msc:05C50 #msc:15A18 #msc:81Q10 #quant-ph
paper · pdf · doi:10.48550/arxiv.1802.01531
16 pages, 1 figure; many changes to improve presentation since earlier version
openalex publication_date 2018/02/05 · arxiv created 2019/06/24 · arxiv updated 2019/06/26 · openalex created_date 2022/03/02 · openalex updated_date 2026/07/28
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with respect to inter-qubit interactions of a quantum system. We perform various perturbations to the hypercube graph---a graph that is known to exhibit PST---to create graphs that maintain many of the same properties of the hypercube, including PST as well as the distance for which PST occurs. We show that the sensitivity with respect to readout time errors remains unaffected for the vertices involved in PST. We give motivation for when these perturbations may be physically desirable or even necessary.