Laplacian Fractional Revival on Graphs

• URL: http://arxiv.org/abs/2010.10413v1
• Date: Tue, 20 Oct 2020 16:20:59 GMT
• Title: Laplacian Fractional Revival on Graphs
• Authors: Ada Chan, Bobae Johnson, Mengzhen Liu, Malena Schmidt, Zhanghan Yin, Hanmeng Zhan
• Abstract summary: We develop the theory of fractional revival in the quantum walk on a graph using its Laplacian matrix as its matrix. We first give a spectral characterization of Laplacian fractional revival, which leads to the Hamiltonian algorithm to check this phenomenon. We then apply the characterization to special families of graphs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop the theory of fractional revival in the quantum walk on a graph using its Laplacian matrix as the Hamiltonian. We first give a spectral characterization of Laplacian fractional revival, which leads to a polynomial time algorithm to check this phenomenon and find the earliest time when it occurs. We then apply the characterization theorem to special families of graphs. In particular, we show that no tree admits Laplacian fractional revival except for the paths on two and three vertices, and the only graphs on a prime number of vertices that admit Laplacian fractional revival are double cones. Finally, we construct, through Cartesian products and joins, several infinite families of graphs that admit Laplacian fractional revival; some of these graphs exhibit polygamous fractional revival.

Related papers

• A framework for generalizing toric inequalities for holographic entanglement entropy [0.10923877073891444]
  We conjecture and prove a generalization of the toric inequalities of citeCzech:2023xed for some range of parameters. We extend their proof methods for the generalized toric inequalities in two ways.
  arXiv  Detail & Related papers  (2024-08-08T19:51:23Z)
• 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)
• Graphon Pooling for Reducing Dimensionality of Signals and Convolutional Operators on Graphs [131.53471236405628]
  We present three methods that exploit the induced graphon representation of graphs and graph signals on partitions of [0, 1]2 in the graphon space. We prove that those low dimensional representations constitute a convergent sequence of graphs and graph signals. We observe that graphon pooling performs significantly better than other approaches proposed in the literature when dimensionality reduction ratios between layers are large.
  arXiv  Detail & Related papers  (2022-12-15T22:11:34Z)
• Quantum isomorphism of graphs from association schemes [0.0]
  We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes.
  arXiv  Detail & Related papers  (2022-09-10T03:22:28Z)
• Fractional revival on abelian Cayley graphs [23.909933791900322]
  Fractional revival is essential for entanglement generation in quantum spin networks. Two general constructions of abelian Cayley graphs having fractional revival are presented. We establish several new families of abelian Cayley graphs admitting fractional revival.
  arXiv  Detail & Related papers  (2022-08-10T02:01:44Z)
• Spectral embedding and the latent geometry of multipartite networks [67.56499794542228]
  Many networks are multipartite, meaning their nodes can be divided into partitions and nodes of the same partition are never connected. This paper demonstrates that the node representations obtained via spectral embedding live near partition-specific low-dimensional subspaces of a higher-dimensional ambient space. We propose a follow-on step after spectral embedding, to recover node representations in their intrinsic rather than ambient dimension.
  arXiv  Detail & Related papers  (2022-02-08T15:52:03Z)
• Multilayer Graph Clustering with Optimized Node Embedding [70.1053472751897]
  multilayer graph clustering aims at dividing the graph nodes into categories or communities. We propose a clustering-friendly embedding of the layers of a given multilayer graph. Experiments show that our method leads to a significant improvement.
  arXiv  Detail & Related papers  (2021-03-30T17:36:40Z)
• Factorizable Graph Convolutional Networks [90.59836684458905]
  We introduce a novel graph convolutional network (GCN) that explicitly disentangles intertwined relations encoded in a graph. FactorGCN takes a simple graph as input, and disentangles it into several factorized graphs. We evaluate the proposed FactorGCN both qualitatively and quantitatively on the synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2020-10-12T03:01:40Z)
• 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)
• Geometric presentations of braid groups for particles on a graph [0.0]
  We study geometric presentations of braid groups for particles constrained to move on a graph. In particular, we show that for $3$-connected planar graphs such a quotient reconstructs the well-known planar braid group. Our results are of particular relevance for the study of non-abelian anyons on networks showing new possibilities for non-abelian quantum statistics on graphs.
  arXiv  Detail & Related papers  (2020-06-27T02:10:22Z)
• Approximate quantum fractional revival in paths and cycles [0.0]
  We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs.
  arXiv  Detail & Related papers  (2020-05-01T17:07:17Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.