相关论文: Perfect state transfer over distance-regular spin …
The statistical properties of ensemble of disordered 1D steric spin-chains (SSC) of various length are investigated. Using 1D spin-glass type classical Hamiltonian, the recurrent trigonometrical equations for stationary points and…
Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H(t):=\exp{\left(-itA\right)},\;t\in\Rl$. The graph $G$ is said to admit pretty good state transfer between a pair of vertices $u$ and…
We study the existence of state transfer with respect to the $q$-Laplacian matrix of a graph equipped with a non-trivial involution. We show that the occurrence of perfect state transfer between certain pair (or plus) states in such a graph…
This paper studies a distributed state estimation problem for both continuous- and discrete-time linear systems. A simply structured distributed estimator (comprising interconnected local estimators) is first described for estimating the…
This paper introduces a probabilistic approach for tracking the dynamics of unweighted and directed graphs using state-space models (SSMs). Unlike conventional topology inference methods that assume static graphs and generate point-wise…
We completely characterize circulant graphs with valency up to $4$ that admit perfect state transfer. Those of valency $3$ do not admit it. On the other hand, circulant graphs with valency $4$ admit perfect state transfer only in two…
This paper is the second of two which construct coherent states for spin networks with planar symmetry. Paper 1 constructs set of coherent states peaked at specific values of holonomy and triad. These operators acting on the coherent state…
We propose and analyze an efficient high-dimensional quantum state transfer scheme through an $XXZ$-Heisenberg spin chain in an inhomogeneous magnetic field. By the use of a combination of coherent quantum coupling and free spin-wave…
Spin-1 systems, in comparison to spin-1/2 systems, offer a better security for encoding and transfer of quantum information, primarily due to their larger Hilbert spaces. Superconducting artificial atoms possess multiple energy-levels,…
There has been much recent study on the application of spin chains to quantum state transfer and communication. Here we demonstrate that spin chains set up for perfect quantum state transfer can be utilised to generate remote quantum gates,…
Spontaneous synchronization has long served as a paradigm for behavioral uniformity that can emerge from interactions in complex systems. When the interacting entities are identical and their coupling patterns are also identical, the…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…
Quantum communication through spin chains has been extensively investigated. In this scenario, state transfer through linearly arranged spins connected by uniform nearest-neighbor couplings qualifies as a natural choice, with minimal…
We present an analytical study of state transfer in a spin chain in the presence of an inhomogeneous set of exchange coefficients. We initially consider the homogeneous case and describe a method to obtain the energy spectrum of the system.…
Quantum state transfer in a triangular domain of a two-dimensional, equally-spaced, spin lat- tice with non-homogeneous nearest-neighbor couplings is analyzed. An exact solution of the one- excitation dynamics is provided in terms of…
In this paper we derive analytical relations between probabilities of the excited state transfers and entanglements calculated by both the Wootters and positive partial transpose (PPT) criteria for the arbitrary spin system with single…
In this exposition we investigate further the general methodology proposed in [Mo2] to study properties of the ground states of a translation invariant Hamiltonian for one lattice dimensional quantum spin chain $\cla=\otimes_{\IZ}M_d$,…
If $X$ is a graph with adjacency matrix $A$, then we define $H(t)$ to be the operator $\exp(itA)$. We say that we have perfect state transfer in $X$ from the vertex $u$ to the vertex $v$ at time $\tau$ if the $uv$-entry of…
We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which…
We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples…