Signless Laplacian State Transfer on Vertex Complemented Coronae

• URL: http://arxiv.org/abs/2502.14460v1
• Date: Thu, 20 Feb 2025 11:29:39 GMT
• Title: Signless Laplacian State Transfer on Vertex Complemented Coronae
• Authors: Ke-Yu Zhu, Gui-Xian Tian, Shu-Yu Cui,
• Abstract summary: The present article deals with quantum state transfer of. vertebrae complemented coronae concerning signless Laplacian matrix. Our research investigates conditions in which signless Laplacian perfect state transfer exists or not on. vertebrae complemented coronae.
• Score: 5.427801421089812
• License:
• Abstract: Given a graph $G$ with vertex set $V(G)=\{v_1,v_2,\ldots,v_{n_1}\}$ and a graph $H$ of order $n_2$, the vertex complemented corona, denoted by $G\tilde{\circ}{H}$, is the graph produced by copying $H$ $n_1$ times, with the $i$-th copy of $H$ corresponding to the vertex $v_i$, and then adding edges between any vertex in $V(G)\setminus\{v_{i}\}$ and any vertex of the $i$-th copy of $H$. The present article deals with quantum state transfer of vertex complemented coronae concerning signless Laplacian matrix. Our research investigates conditions in which signless Laplacian perfect state transfer exists or not on vertex complemented coronae. Additionally, we also provide some mild conditions for the class of graphs under consideration that allow signless Laplacian pretty good state transfer.

Related papers

• Graph Unfolding and Sampling for Transitory Video Summarization via Gershgorin Disc Alignment [48.137527345353625]
  User-generated videos (UGVs) uploaded from mobile phones to social media sites like YouTube and TikTok are short and non-repetitive. We summarize a transitory UGV into several discs in linear time via fast graph sampling based on Gershgorin disc alignment (GDA) We show that our algorithm achieves comparable or better video summarization performance compared to state-of-the-art methods, at a substantially reduced complexity.
  arXiv  Detail & Related papers  (2024-08-03T20:08:02Z)
• Perfect state transfer on Cayley graphs over a non-abelian group of order $8n$ [0.0]
  We study the existence of perfect state transfer on Cayley graphs $textCay(V_8n, S)$.
  arXiv  Detail & Related papers  (2024-05-03T14:24:51Z)
• 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)
• Detection of Dense Subhypergraphs by Low-Degree Polynomials [72.4451045270967]
  Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem. We consider detecting the presence of a planted $Gr(ngamma, n-alpha)$ subhypergraph in a $Gr(n, n-beta) hypergraph. Our results are already new in the graph case $r=2$, as we consider the subtle log-density regime where hardness based on average-case reductions is not known.
  arXiv  Detail & Related papers  (2023-04-17T10:38:08Z)
• On the Unlikelihood of D-Separation [69.62839677485087]
  We provide analytic evidence that on large graphs, d-separation is a rare phenomenon, even when guaranteed to exist. For the PC Algorithm, while it is known that its worst-case guarantees fail on non-sparse graphs, we show that the same is true for the average case. For UniformSGS, while it is known that the running time is exponential for existing edges, we show that in the average case, that is the expected running time for most non-existing edges as well.
  arXiv  Detail & Related papers  (2023-03-10T00:11:18Z)
• Efficient Signed Graph Sampling via Balancing & Gershgorin Disc Perfect Alignment [51.74913666829224]
  We show that for datasets with strong inherent anti-correlations, a suitable graph contains both positive and negative edge weights. We propose a linear-time signed graph sampling method centered on the concept of balanced signed graphs. Experimental results show that our signed graph sampling method outperformed existing fast sampling schemes noticeably on various datasets.
  arXiv  Detail & Related papers  (2022-08-18T09:19:01Z)
• Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems [0.0]
  We prove that the continuous-time quantum walk (CTQW) -- with Hamiltonian $H=gamma L$ -- does not depend on the graph $G$. We apply our results to spatial search and quantum transport for single and multiple fully connected marked vertices.
  arXiv  Detail & Related papers  (2022-02-28T14:33:44Z)
• State Transfer on Paths with Weighted Loops [0.0]
  It is known that if $w$ is transcendental, then there is pretty good state transfer from one end to the other. We prove a companion result to that fact, namely that there is a dense subset of $[1,infty)$ such that if $w$ is in that subset, pretty good state transfer between end vertices is impossible.
  arXiv  Detail & Related papers  (2021-12-04T16:11:40Z)
• Fast Graph Sampling for Short Video Summarization using Gershgorin Disc Alignment [52.577757919003844]
  We study the problem of efficiently summarizing a short video into several paragraphs, leveraging recent progress in fast graph sampling. Experimental results show that our algorithm achieves comparable video summarization as state-of-the-art methods, at a substantially reduced complexity.
  arXiv  Detail & Related papers  (2021-10-21T18:43:00Z)
• Laplacian State Transfer on Graphs with an Edge Perturbation Between Twin Vertices [0.0]
  We consider quantum state transfer relative to the Laplacian matrix of a graph. We investigate the existence of quantum state transfer between a pair of twin vertices in a graph when the edge between the vertices is perturbed.
  arXiv  Detail & Related papers  (2021-09-11T15:48:18Z)
• Projection-free Graph-based Classifier Learning using Gershgorin Disc Perfect Alignment [59.87663954467815]
  In graph-based binary learning, a subset of known labels $hatx_i$ are used to infer unknown labels. When restricting labels $x_i$ to binary values, the problem is NP-hard. We propose a fast projection-free method by solving a sequence of linear programs (LP) instead.
  arXiv  Detail & Related papers  (2021-06-03T07:22:48Z)

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.