Inverse problems in quantum graphs and accidental degeneracy
- URL: http://arxiv.org/abs/2103.16727v2
- Date: Tue, 11 Oct 2022 17:15:06 GMT
- Title: Inverse problems in quantum graphs and accidental degeneracy
- Authors: Emerson Sadurni, Thomas H Seligman
- Abstract summary: The direct spectral problem and the inverse spectral problem are written in terms of simple equations containing information on the topology of a quantum graph.
The inverse problem is shown to beener, and some low dimensional examples are explicitly solved.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: A general treatment of the spectral problem of quantum graphs and
tight-binding models in finite Hilbert spaces is given. The direct spectral
problem and the inverse spectral problem are written in terms of simple
algebraic equations containing information on the topology of a quantum graph.
The inverse problem is shown to be combinatorial, and some low dimensional
examples are explicitly solved. For a {\it window\ }graph, a commutator and
anticommutator algebra (superalgebra) is identified as the culprit behind
accidental degeneracy in the form of triplets, where configurational symmetry
{\it alone\ }fails to explain the result. For a M\"obius cycloacene graph, it
is found that the accidental triplet cannot be explained with a superalgebra,
but that the graph can be built unambiguously from the spectrum using
combinatorial methods. These examples are compared with a more symmetric but
less degenerate system, i.e. a {\it car wheel\ } graph which possesses neither
triplets, nor superalgebra.
Related papers
- HeNCler: Node Clustering in Heterophilous Graphs through Learned Asymmetric Similarity [55.27586970082595]
HeNCler is a novel approach for Heterophilous Node Clustering.
We show that HeNCler significantly enhances performance in node clustering tasks within heterophilous graph contexts.
arXiv Detail & Related papers (2024-05-27T11:04:05Z) - Random walks on simplicial complexes [0.9937132009954994]
We show that the generator of our Markov chain is the upper Laplacian defined in the context of algebraic topology for discrete structure.
We study the diffusive limits when the simplicial complexes under scrutiny are a sequence of ever refining triangulations of the flat torus.
arXiv Detail & Related papers (2024-04-12T20:37:34Z) - 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) - 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) - Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov
Random Fields [51.07460861448716]
This paper presents a convex-analytic framework to learn from data.
We show that a triangular convexity decomposition is guaranteed by a transform of the corresponding to its upper part.
arXiv Detail & Related papers (2021-09-17T17:46:12Z) - Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix
Factorization [49.090785356633695]
We study the asymmetric low-rank factorization problem: [mathbfU in mathbbRm min d, mathbfU$ and mathV$.
arXiv Detail & Related papers (2021-06-27T17:25:24Z) - Spectral clustering under degree heterogeneity: a case for the random
walk Laplacian [83.79286663107845]
This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree.
In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
arXiv Detail & Related papers (2021-05-03T16:36:27Z) - Non-commutative graphs based on finite-infinite system couplings:
quantum error correction for a qubit coupled to a coherent field [0.0]
We study error correction in the case of a finite-dimensional quantum system coupled to an infinite dimensional system.
We find the quantum anticlique, which is the projector on the error correcting subspace, and analyze it as a function of the frequencies of the qubit and the bosonic field.
arXiv Detail & Related papers (2021-04-24T12:06:43Z) - 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) - On errors generated by unitary dynamics of bipartite quantum systems [0.0]
Given a quantum channel it is possible to define the non-commutative operator graph whose properties determine a possibility of error-free transmission of information via this channel.
We are discussing the opposite problem of a proper definition of errors that some graph corresponds to.
arXiv Detail & Related papers (2020-08-01T16:22:19Z)
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.