Related papers: Perfect state transfer over distance-regular spin …
We study transfer of a quantum state through XX spin chains with static imperfections. We combine the two standard approaches for state transfer based on (i) modulated couplings between neighboring spins throughout the spin chain and (ii)…
We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs. The latter class is a generalization of the former. We first give a complete classification of…
Regular families of coupled quantum networks are described such the unknown state of a qubit can be perfectly routed from any node to any other node in a time linear in the distance. Unlike previous constructions, the transfer can be…
We study the protocol known as quantum state transfer for a strongly coupled antiferromagnetic spin chain or ring (acting as a spin bus), with weakly coupled external qubits. By treating the weak coupling as a perturbation, we find that…
In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off…
We show that a perfect quantum state transmission can be realized through a spin chain possessing a commensurate structure of energy spectrum, which is matched with the corresponding parity. As an exposition of the mirror inversion symmetry…
To transport high-quality quantum state between two distant qubits through one-dimensional spin chains, the perfect state transfer (PST) method serves as the first choice, due to its natively perfect transfer fidelity that is independent of…
An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer ($\PST$ for short) and multiple state…
A mixed circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer (PST for short) and multiple state…
The transfer of a quantum state between distant nodes in two-dimensional networks, is considered. The fidelity of state transfer is calculated as a function of the number of interactions in networks that are described by regular graphs. It…
The quantum state transmission (QST) through the medium of high-dimensional many-particle system is studied with a symmetry analysis. We discover that, if the spectrum matches the symmetry of a fermion or boson system in a certain fashion,…
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…
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex…
We consider an exact state transmission, where a density matrix in one information processor A at time $t=0$ is exactly equal to that in another processor B at a later time. We demonstrate that there always exists a complete set of…
We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-1/2 network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and…
An extension with next-to-nearest neighbour interactions of the simplest XX spin chain with perfect state transfer (PST) is presented. The conditions for PST and entanglement generation (balanced fractional revival) can be obtained exactly…
We propose a class of qubit networks that admit perfect transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be…
A continuous-time quantum walk on a graph evolves according to the unitary operator $e^{-iAt}$, where $A$ is the adjacency matrix of the graph. Perfect state transfer (PST) in a quantum walk is the transfer of a quantum state from one node…
We propose a hypercube switching architecture for the perfect state transfer (PST) where we prove that it is always possible to find an induced hypercube in any given hypercube of any dimension such that PST can be performed between any two…
The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time…