Perfect $(s,r)$-state transfer

• URL: http://arxiv.org/abs/2609.10713v1
• Date: Wed, 09 Sep 2026 18:10:33 GMT
• Title: Perfect $(s,r)$-state transfer
• Abstract summary: We study perfect state transfer in a quantum spin network using an undirected graph.<n>We identify infinite families of graphs with perfect $(s,r)$-state transfer.<n>We also provide a sensitivity analysis, with respect to readout time errors, of perfect $(s,r)$-state transfer.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Much work has been done in the last two decades on the topic of quantum state transfer in a quantum spin network. One can model such a system of interacting qubits using an undirected graph, and studying vertex-to-vertex dynamics. This setup has recently been relaxed to allow for dynamics between linear combinations of two vertex states, i.e.\ from $\mathbf u = \mathbf e_a + s \mathbf e_b$ to $\mathbf μ=\mathbf e_α + r \mathbf e_β$, where $r=s$ is either $-1$ (which corresponds to pair state transfer) or $+1$ (which corresponds to plus state transfer), or more recently $r=s$ is taken to be any real number (which corresponds to $s$-pair state transfer). Here, we broaden the investigation of $s$-pair state transfer to \textit{perfect $(s,r)$-state transfer}, which is perfect state transfer from $\mathbf u = \mathbf e_a + s \mathbf e_b$ to $\mathbf μ=\mathbf e_α + r \mathbf e_β$ (up to some dilation) where $r,s\in \mathbb C$. We identify infinite families of graphs with perfect $(s,r)$-state transfer and provide characterizations of cases when $|r|= |s|$ and when $|r|\neq |s|$, showing situations when the degree of entanglement between vertex states is preserved, and when it is not preserved. The latter is particularly important as it represents perfect state transfer from an entangled pair of qubits to another one where the degree of entanglement need not be the same\mdash in fact, it can be set up so as to ``boost'' (increase) entanglement. We provide an algorithm that finds the vector with two nonzero entries that maximizes the fidelity of transfer for a fixed time $t$ starting from a given $s$-pair state $\mathbf u$. Finally, we provide a sensitivity analysis, with respect to readout time errors, of perfect $(s,r)$-state transfer.

Related papers

• Perfect State Transfer from a Localised Two-Excitation State to a Dicke State via Static Spin-Network Hamiltonians [0.0]
  I construct a family of time-independent, symmetric-preserving spin Hamiltonians that realises perfect state transfer.<n>The construction exploits an $S_N-2$ permutation symmetry acting on the initially unoccupied spins.<n>For every $N ge 4$ an odd $n$ can be chosen large enough that a real root with $z -2$ exists.
  arXiv  Detail & Related papers  (2026-09-09T03:06:14Z)
• Sparse Quantum State Preparation with Sublinear T-Count [5.929956715430168]
  We show that any $n$-qubit $s$-sparse state can be prepared up to error $$ using $widetildeO(mins, n3/4sqrts+sqrtslog (1/)+log (1/)$ $T$ gates.<n>For every $0le$ and $2le sle 2n/2$, sparse-state preparation requires $(mins,sqrtns)$ $T
  arXiv  Detail & Related papers  (2026-08-01T03:33:19Z)
• Tripartite information of free fermions: a universal entanglement coefficient from the sine kernel [51.56484100374058]
  We study the tripartite information I_3 of free fermions on two-dimensional lattices partitioned into three adjacent strips of width w.<n>We find that g(z) has a unique zero at z* = 1.329 +/- 0.001: modes with k_F w z* violate monogamy of mutual information.<n>Two exact cancellations -- of the z ln z area-law terms and of the z2 terms -- are intrinsic to the I_3 combination.
  arXiv  Detail & Related papers  (2026-03-03T15:39:35Z)
• Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination [65.37519531362157]
  We show that any efficient Statistical Query algorithm for this task requires VSTAT complexity at least $tildeOmega(d1/2/alpha2)$.
  arXiv  Detail & Related papers  (2025-10-12T15:42:44Z)
• Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs [54.28273395444243]
  We show that the Monotonic Value Omega (MVP) algorithm achieves a variance-aware gap-dependent regret bound of $$tildeOleft(left(sum_Delta_h(s,a)>0 fracH2 log K land mathttVar_maxtextc$.
  arXiv  Detail & Related papers  (2025-06-06T20:33:57Z)
• Improved convergence rate of kNN graph Laplacians [11.93971616098517]
  General class of $k$NN graph where the graph affinity is $W_ij = epsilon-d/2 . We prove the point-wise convergence of the $k$NN graph Laplacian to the limiting manifold operator.
  arXiv  Detail & Related papers  (2024-10-30T17:01:00Z)
• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• $\ell_p$-Regression in the Arbitrary Partition Model of Communication [59.89387020011663]
  We consider the randomized communication complexity of the distributed $ell_p$-regression problem in the coordinator model. For $p = 2$, i.e., least squares regression, we give the first optimal bound of $tildeTheta(sd2 + sd/epsilon)$ bits. For $p in (1,2)$,we obtain an $tildeO(sd2/epsilon + sd/mathrmpoly(epsilon)$ upper bound.
  arXiv  Detail & Related papers  (2023-07-11T08:51:53Z)
• 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)
• Spiked Covariance Estimation from Modulo-Reduced Measurements [14.569322713960494]
  We develop and analyze an algorithm that, for most directions $bfu$ and $nu=mathrmpoly(k)$, estimates $bfu$ to high accuracy using $n=mathrmpoly(k)$ measurements. Numerical experiments show that the developed algorithm performs well even in a non-asymptotic setting.
  arXiv  Detail & Related papers  (2021-10-04T02:10:47Z)
• How many moments does MMD compare? [7.919213739992465]
  mathcalF-1$ acts on smooth functions in the same way as an integral operator associated with $K$. We show that kernels defined by pseudo-differential operators are able to approximate uniformly any continuous Mercer kernel on a compact set.
  arXiv  Detail & Related papers  (2021-06-27T16:44:17Z)
• Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity [94.37110094442136]
  We study the problem of agnostic $Q$-learning with function approximation in deterministic systems. We show that if $delta = Oleft(rho/sqrtdim_Eright)$, then one can find the optimal policy using $Oleft(dim_Eright)$.
  arXiv  Detail & Related papers  (2020-02-17T18:41:49Z)
• Backtracking Gradient Descent allowing unbounded learning rates [0.0]
  In unconstrained optimisation on an Euclidean space, to prove convergence in Gradient Descent processes (GD) $x_n+1=x_n-delta _n nabla f(x_n)$ it usually is required that the learning rates $delta _n$'s are bounded. In this paper, we allow the learning rates $delta _n$ to be unbounded. It will be shown that this growth rate of $h$ is best possible if one wants convergence of the sequence $x_n$.
  arXiv  Detail & Related papers  (2020-01-07T12:52:00Z)

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.