Pretty good quantum state transfer in asymmetric graphs via potential

DOI10.1016/J.DISC.2018.10.037MaRDI QIDQ2317650zbMATH OpenOpenAlexWikidataFDO

Authors Or Eisenberg, Mark Kempton, Gabor Lippner

Publication date 12 August 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.01645

zbMATH Keywords

cospectralquantum state transferquantum walk

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Abstract: We construct infinite families of graphs in which pretty good state transfer can be induced by adding a potential to the nodes of the graph (i.e. adding a number to a diagonal entry of the adjacency matrix). Indeed, we show that given any graph with a pair of cospectral nodes, a simple modification of the graph, along with a suitable potential, yields pretty good state transfer (i.e. asymptotically perfect state transfer) between the nodes. This generalizes previous work, concerning graphs with an involution, to asymmetric graphs.

Recommendations

• Pretty good state transfer on circulant graphs
• Quantum state transfer on a class of circulant graphs
• Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Quantum state transfer on the complete bipartite graph
• Perfect state transfer on quotient graphs
• Pretty good quantum state transfer in symmetric spin networks via magnetic field
• Pretty good state transfer on Cayley graphs over semi-dihedral groups
• QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
• Perfect state transfer on \(\gcd\)-graphs

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Perfect state transfer on quotient graphs
• Perfect, efficient, state transfer and its application as a constructive tool
• Pretty good quantum state transfer in symmetric spin networks via magnetic field
• Pretty good state transfer in qubit chains -- the Heisenberg Hamiltonian
• State transfer on graphs

Cited in

(11)

• Pretty good quantum state transfer in symmetric spin networks via magnetic field
• Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
• Characterizing cospectral vertices via isospectral reduction
• An infinite family of circulant graphs with perfect state transfer in discrete quantum walks
• Pretty good quantum fractional revival in paths and cycles
• Quantum state transfer between twins in weighted graphs
• Irrational Quantum Walks
• Pretty good fractional revival via diagonal perturbation: theory and examples
• Strong quantum state transfer on graphs via loop edges
• Cospectral vertices, walk-regular planar graphs and the echolocation problem
• A characterization of state transfer on double subdivided stars

This page was built for publication: Pretty good quantum state transfer in asymmetric graphs via potential

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317650)