Related papers: No Laplacian Perfect State Transfer in Trees
In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one dimensional cases, such as 1d spin chains. We…
A vertex in a graph is said to be sedentary if a quantum state assigned on that vertex tends to stay on that vertex. Under mild conditions, we show that the direct product and join operations preserve vertex sedentariness. We also…
We study a continous-time quantum walk on a path graph. In this paper, we show that, for any odd prime $p$ and positive integer $t$, the path on $2^t p - 1$ vertices admits pretty good state transfer between vertices $a$ and $n+1-a$ for…
In recent years, significant progress has been made in the field of state transfer in spin chains, with the aim of achieving perfect state transfer for quantum information processing applications. Previous research has mainly focused on…
High-fidelity quantum computation and quantum state transfer are possible in short spin chains. We exploit a system based on a dispersive qubit-boson interaction to mimic XY coupling. In this model, the usually assumed nearest-neighbors…
We study quantum state transfer through a qubit network modeled by spins with XY interaction, when relying on a single excitation. We show that it is possible to achieve perfect transfer by shifting (adding) energy to specific vertices.…
We describe an efficient protocol to perform quantum state transfer using Hamiltonian dynamics with long-range interactions. The time to transfer $n$ qubits a sufficiently large distance is proportional to $\sqrt{n}$. Even without error…
State transfer is a well-known routine for various systems of spins-$\frac{1}2$. Still, it is not well studied for chains of spins of larger magnitudes. In this contribution we argue that while perfect state transfer may seem unnatural in…
Following the prescription of Ref. \cite{PST} in which perfect state transference (PST) of a qubit over distance regular spin networks was discussed, in this paper PST of an arbitrary $d$-level quantum state (qudit) over antipodes of more…
We study the time evolution of a single spin excitation state in certain linear spin chains, as a model for quantum communication. Some years ago it was discovered that when the spin chain data (the nearest neighbour interaction strengths…
Kirchoff's matrix tree theorem of 1847 connects the number of spanning trees of a graph to the spectral determinant of the discrete Laplacian [22]. Recently an analogue was obtained for quantum graphs relating the number of spanning trees…
We consider the state transfer properties of continuous time quantum walks on trees of diameter 4. We characterize all pairs of strongly cospectral vertices in trees of diameter 4, finding that they fall into pairs of three different types.…
Quantum-state transfer with fidelity higher than 0.99 can be achieved in the ballistic regime of an arbitrarily long one-dimensional chain with uniform nearest-neighbor interaction, except for the two pairs of mirror symmetric extremal…
The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this…
We introduce an analytical $XX$ spin chain with asymmetrical transport properties. It has an even number $N+1$ of sites labeled by $n=0,\cdots N$. It does not exhibit perfect state transfer (PST) from end-to-end but rather from the first…
We study state transfer in quantum walk on graphs relative to the adjacency matrix. Our motivation is to understand how the addition of pendant subgraphs affect state transfer. For two graphs $G$ and $H$, the Frucht-Harary corona product $G…
We propose a protocol for perfect quantum state transfer that is resilient to a broad class of realistic experimental imperfections, including noise sources that could be modelled either as independent Markovian baths or as certain forms of…
It is shown that by switching a specific time-dependent interaction between a harmonic oscillator and a transmission line (a waveguide, an optical fiber, etc.) the quantum state of the oscillator can be transferred into that of another…
Let $X$ be a graph on $n$ vertices with with adjacency matrix $A$ and let $H(t)$ denote the matrix-valued function $\exp(iAt)$. If $u$ and $v$ are distinct vertices in $X$, we say perfect state transfer}from $u$ to $v$ occurs if there is a…
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…