Constructing graphs having Laplacian pair state transfer by an edge perturbation

• URL: http://arxiv.org/abs/2202.04957v1
• Date: Thu, 10 Feb 2022 11:22:37 GMT
• Title: Constructing graphs having Laplacian pair state transfer by an edge perturbation
• Authors: Wei Wang, Xiaogang Liu, Jing Wang
• Abstract summary: We construct many new graphs having Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer. By those sufficient conditions, we also construct many new graphs having Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer.
• Score: 7.7566555097445455
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we give some sufficient conditions for graphs with an edge perturbation between twin vertices to have Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer. By those sufficient conditions, we also construct many new graphs having Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer.

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)
• Exact solution of a family of staggered Heisenberg chains with conclusive pretty good quantum state transfer [68.8204255655161]
  We work out the exact solutions in the one-excitation subspace. We present numerical evidence that pretty good transmission is achieved by chains whose length is not a power of two.
  arXiv  Detail & Related papers  (2022-06-28T18:31:09Z)
• Entailment Graph Learning with Textual Entailment and Soft Transitivity [69.91691115264132]
  We propose a two-stage method, Entailment Graph with Textual Entailment and Transitivity (EGT2) EGT2 learns local entailment relations by recognizing possible textual entailment between template sentences formed by CCG-parsed predicates. Based on the generated local graph, EGT2 then uses three novel soft transitivity constraints to consider the logical transitivity in entailment structures.
  arXiv  Detail & Related papers  (2022-04-07T08:33:06Z)
• Laplacian state transfer in vertex complemented coronas [7.4976452082662775]
  We prove that there is no Laplacian perfect state transfer in. vertex complemented coronas. We give a sufficient condition for. vertex complemented coronas to have Laplacian pretty good state transfer.
  arXiv  Detail & Related papers  (2022-02-15T05:33:10Z)
• 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)
• 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)
• Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields [53.31927549039624]
  We show that a piecewise discretization preserves better contrast from existing discretization problems. We apply this theory to the problem of matching two images.
  arXiv  Detail & Related papers  (2021-07-13T12:31:06Z)
• Pretty Good State Transfer and Minimal Polynomials [0.0]
  We provide cases where pretty good state transfer can be ruled out. We also provide new examples of simple, unweighted graphs exhibiting pretty good state transfer.
  arXiv  Detail & Related papers  (2020-10-14T02:24:20Z)
• 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)
• 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)
• Perfect State Transfer on Oriented Graphs [0.0]
  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.
  arXiv  Detail & Related papers  (2020-02-11T20:34:54Z)

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.