State Transfer on Paths with Weighted Loops

• URL: http://arxiv.org/abs/2112.02369v1
• Date: Sat, 4 Dec 2021 16:11:40 GMT
• Title: State Transfer on Paths with Weighted Loops
• Authors: Stephen Kirkland and Christopher M. van Bommel
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the fidelity of state transfer on an unweighted path on $n$ vertices, where a loop of weight $w$ has been appended at each of the end vertices. It is known that if $w$ is transcendental, then there is pretty good state transfer from one end vertex 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. Under mild hypotheses on $w$ and $t$, we derive upper and lower bounds on the fidelity of state transfer between end vertices at readout time $t$. Using those bounds, we localise the readout times for which that fidelity is close to $1$. We also provide expressions for, and bounds on, the sensitivity of the fidelity of state transfer between end vertices, where the sensitivity is with respect to either the readout time or the weight $w$. Throughout, the results rely on detailed knowledge of the eigenvalues and eigenvectors of the associated adjacency matrix.

Related papers

• Signless Laplacian State Transfer on Vertex Complemented Coronae [5.427801421089812]
  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.
  arXiv  Detail & Related papers  (2025-02-20T11:29:39Z)
• Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback [49.84060509296641]
  We study online finite-horizon Markov Decision Processes with adversarially changing loss and aggregate bandit feedback (a.k.a full-bandit) Under this type of feedback, the agent observes only the total loss incurred over the entire trajectory, rather than the individual losses at each intermediate step within the trajectory. We introduce the first Policy Optimization algorithms for this setting.
  arXiv  Detail & Related papers  (2025-02-06T12:03:24Z)
• State Transfer and Readout Times for Trees of Diameter 4 [0.0]
  We consider the state transfer properties of continuous time quantum walks on trees of diameter 4. For each type, we construct an infinite family of diameter 4 trees for which there is pretty good state transfer. For strongly cospectral vertices of the remaining type, we identify a sequence of trees and explicit readout times.
  arXiv  Detail & Related papers  (2024-06-21T16:32:45Z)
• 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)
• 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)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• 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)
• 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)
• Nearly Horizon-Free Offline Reinforcement Learning [97.36751930393245]
  We revisit offline reinforcement learning on episodic time-homogeneous Markov Decision Processes with $S$ states, $A$ actions and planning horizon $H$. We obtain the first set of nearly $H$-free sample complexity bounds for evaluation and planning using the empirical MDPs.
  arXiv  Detail & Related papers  (2021-03-25T18:52:17Z)
• Private Stochastic Convex Optimization: Optimal Rates in $\ell_1$ Geometry [69.24618367447101]
  Up to logarithmic factors the optimal excess population loss of any $(varepsilon,delta)$-differently private is $sqrtlog(d)/n + sqrtd/varepsilon n.$ We show that when the loss functions satisfy additional smoothness assumptions, the excess loss is upper bounded (up to logarithmic factors) by $sqrtlog(d)/n + (log(d)/varepsilon n)2/3.
  arXiv  Detail & Related papers  (2021-03-02T06:53:44Z)
• Analysis of KNN Density Estimation [56.29748742084386]
  kNN density estimation is minimax optimal under both $ell_infty$ and $ell_infty$ criteria, if the support set is known. The $ell_infty$ error does not reach the minimax lower bound, but is better than kernel density estimation.
  arXiv  Detail & Related papers  (2020-09-30T03:33: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.