Spectrally extremal vertices, strong cospectrality, and state transfer

zbMATH Open1333.05179arXiv1501.04398MaRDI QIDQ259181FDOQ259181

Authors: Gabriel Coutinho 

Publication date: 11 March 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the structure of graphs containing pairs of vertices which are strongly cospectral and satisfy a certain extremal property related to the spectrum of the graph. If the graph satisfies this property globally and is regular, we also show that the existence of a partition of the vertex set into pairs of vertices at maximum distance admitting perfect state transfer forces the graph to be distance-regular.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• When can perfect state transfer occur?
• Perfect state transfer on distance-regular graphs and association schemes
• Strong Cospectrality and Twin Vertices in Weighted Graphs
• Perfect state transfer, graph products and equitable partitions
• Some results for the periodicity and perfect state transfer

zbMATH Keywords

graph theorycospectral verticesquantum walks

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quantum computation (81P68) Association schemes, strongly regular graphs (05E30)

Cites Work

• Spectra of graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• Algebraic Graph Theory
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Locally pseudo-distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Perfect state transfer on distance-regular graphs and association schemes
• On almost distance-regular graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• When can perfect state transfer occur?
• Perfect state transfer, integral circulants and join of graphs
• From regular boundary graphs to antipodal distance-regular graphs
• A spectral excess theorem for nonregular graphs
• Further results on the perfect state transfer in integral circulant graphs
• Perfect state transfer in cubelike graphs
• Some results for the periodicity and perfect state transfer
• State transfer on graphs

Cited In (8)

• Title not available (Why is that?)
• Fractional revival on Cayley graphs over abelian groups
• Laplacian state transfer in edge complemented coronas
• State transfers in vertex complemented coronas
• Laplacian state transfer in edge coronas
• Characterizing cospectral vertices via isospectral reduction
• Laplacian pair state transfer in vertex coronas
• Quantum walks and the size of the graph

This page was built for publication: Spectrally extremal vertices, strong cospectrality, and state transfer

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