Fundamentals of fractional revival in graphs
- URL: http://arxiv.org/abs/2004.01129v1
- Date: Thu, 2 Apr 2020 16:57:09 GMT
- Title: Fundamentals of fractional revival in graphs
- Authors: Ada Chan, Gabriel Coutinho, Whitney Drazen, Or Eisenberg, Chris
Godsil, Gabor Lippner, Mark Kempton, Christino Tamon, Hanmeng Zhan
- Abstract summary: We develop a general spectral framework to analyze quantum fractional revival in quantum spin networks.
In particular, we introduce generalizations of the notions of cospectral and strongly cospectral vertices to arbitrary subsets of vertices.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We develop a general spectral framework to analyze quantum fractional revival
in quantum spin networks. In particular, we introduce generalizations of the
notions of cospectral and strongly cospectral vertices to arbitrary subsets of
vertices, and give various examples. This work resolves two open questions of
Chan et.~al. ["Quantum Fractional Revival on graphs". Discrete Applied Math,
269:86-98, 2019.]
Related papers
- A Manifold Perspective on the Statistical Generalization of Graph Neural Networks [84.01980526069075]
Graph Neural Networks (GNNs) combine information from adjacent nodes by successive applications of graph convolutions.
We study the generalization gaps of GNNs on both node-level and graph-level tasks.
We show that the generalization gaps decrease with the number of nodes in the training graphs.
arXiv Detail & Related papers (2024-06-07T19:25:02Z) - Gaussian Entanglement Measure: Applications to Multipartite Entanglement
of Graph States and Bosonic Field Theory [50.24983453990065]
An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers.
We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states.
By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
arXiv Detail & Related papers (2024-01-31T15:50:50Z) - On the Expressiveness and Generalization of Hypergraph Neural Networks [77.65788763444877]
This extended abstract describes a framework for analyzing the expressiveness, learning, and (structural) generalization of hypergraph neural networks (HyperGNNs)
Specifically, we focus on how HyperGNNs can learn from finite datasets and generalize structurally to graph reasoning problems of arbitrary input sizes.
arXiv Detail & Related papers (2023-03-09T18:42:18Z) - 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 bounds for the quantum chromatic number of quantum graphs [0.0]
We obtain lower bounds for the classical and quantum number of a quantum graph using eigenvalues of the quantum adjacency matrix.
We generalize all the spectral bounds given by Elphick and Wocjan to the quantum graph setting.
Our results are achieved using techniques from linear algebra and a complete definition of quantum graph coloring.
arXiv Detail & Related papers (2021-12-03T05:36:21Z) - Multipartite Generalization of Geometric measure of Discord [0.0]
We find generic forms of the generalization of geometric measure of quantum discord in a general N-partite quantum state.
We obtain computable exact formulas for the generalization of geometric measure of quantum discord in an N-qubit quantum state.
arXiv Detail & Related papers (2021-09-24T14:13:03Z) - Quantum particle across Grushin singularity [77.34726150561087]
We study the phenomenon of transmission across the singularity that separates the two half-cylinders.
All the local realisations of the free (Laplace-Beltrami) quantum Hamiltonian are examined as non-equivalent protocols of transmission/reflection.
This allows to comprehend the distinguished status of the so-called bridging' transmission protocol previously identified in the literature.
arXiv Detail & Related papers (2020-11-27T12:53:23Z) - 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) - 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) - Topologically induced spectral behavior: the example of quantum graphs [0.0]
We show that a nontrivial topology of the configuration space can give rise to a rich variety of spectral types.
We also address the question about the number of open spectral gaps and show that it could be nonzero and finite.
arXiv Detail & Related papers (2020-03-13T10:26:25Z) - A refinement of Reznick's Positivstellensatz with applications to
quantum information theory [72.8349503901712]
In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares.
Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
arXiv Detail & Related papers (2019-09-04T11:46:26Z)
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.