Related papers: Perfect State Transfer on Oriented Graphs

Perfect State Transfer on Oriented Graphs

URL: http://arxiv.org/abs/2002.04666v2
Date: Wed, 24 Jun 2020 20:13:49 GMT
Title: Perfect State Transfer on Oriented Graphs
Authors: Chris Godsil and Sabrina Lato
Abstract summary: We study the phenomena, unique to oriented graphs, of multiple state transfer. We give a characterization of multiple state transfer, and a new example of a graph where it occurs.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Quantum walks on undirected graphs have been studied using symmetric matrices, such as the adjacency or Laplacian matrix, and many results about perfect state transfer are known. We extend some of those results to oriented graphs. We also study the phenomena, unique to oriented graphs, of multiple state transfer, where there is a set of vertices such that perfect state transfer occurs between every pair in that set. We give a characterization of multiple state transfer, and a new example of a graph where it occurs.

Related papers

A generalization of quantum pair state transfer [0.0]
An $s$-pair state in a graph is a quantum state of the form $mathbfe_u+smathbfe_v$. We develop the theory of perfect $s$-pair state transfer in continuous quantum walks.
arXiv Detail & Related papers (2024-04-25T14:45:49Z)
Graph Generation via Spectral Diffusion [51.60814773299899]
We present GRASP, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and eigenvalues from which we can reconstruct the graph Laplacian and adjacency matrix. Our permutation invariant model can also handle node features by concatenating them to the eigenvectors of each node.
arXiv Detail & Related papers (2024-02-29T09:26:46Z)
You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction [79.15394378571132]
We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
arXiv Detail & Related papers (2023-02-27T22:56:06Z)
Quantum state transfer between twins in weighted graphs [0.0]
We explore the role of twin vertices in quantum state transfer. We provide characterizations of periodicity, perfect state transfer, and pretty good state transfer. As an application, we provide characterizations of all simple unweighted double cones on regular graphs that exhibit periodicity, perfect state transfer, and pretty good state transfer.
arXiv Detail & Related papers (2022-01-08T01:15:24Z)
Perfect state transfer in Grover walks between states associated to vertices of a graph [0.0]
We study perfect state transfer in Grover walks, which are typical discrete-time quantum walk models. We call such states type states. We derive a necessary condition on eigenvalues of a graph for perfect state transfer between type states to occur.
arXiv Detail & Related papers (2021-09-14T03:59:47Z)
Pretty good state transfer in discrete-time quantum walks [0.0]
We establish the theory for pretty good state transfer in discrete-time quantum walks. For a class of walks, we show that pretty good state transfer is characterized by the spectrum of certain Hermitian adjacency matrix of the graph.
arXiv Detail & Related papers (2021-05-08T18:55:57Z)
Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
arXiv Detail & Related papers (2020-08-11T17:58:13Z)
Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer. The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
arXiv Detail & Related papers (2020-03-25T02:46:14Z)
Perfect edge state transfer on cubelike graphs [13.477892615179481]
We show that every bent function, and some semi-bent functions as well, can produce some graphs having PEST. Notably, using our method, one can obtain some classes of infinite graphs possessing PEST.
arXiv Detail & Related papers (2020-03-24T02:33:32Z)
Asymptotic entropy of the Gibbs state of complex networks [68.8204255655161]
The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. Our results show that the behavior of Gibbs entropy as a function of the temperature differs for a choice of real networks when compared to the random ErdHos-R'enyi graphs.
arXiv Detail & Related papers (2020-03-18T18:01:28Z)
Wasserstein-based Graph Alignment [56.84964475441094]
We cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. We show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.
arXiv Detail & Related papers (2020-03-12T22:31:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.