Related papers: Pretty Good State Transfer and Minimal Polynomials
Efficient quantum-state transfer is achieved in a uniformly coupled spin-1/2 chain, with open boundaries, by application of local magnetic fields on the second and last-but-one spins, respectively. These effective \textit{barriers} induce…
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…
The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and adding a new edge between two new vertices which lie on adjacent edges of $G$. In this…
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…
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…
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…
Multiple quantum (MQ) NMR coherence spectra, which can be obtained experimentally in MQ NMR, can be transferred from the sender to the remote receiver without mixing the MQ-coherences of different orders and distortions. The only effect of…
We analyzed the yield and fidelity of the quantum state transfer (QST) from a photon polarization qubit to an electron spin qubit in a spin-coherent photo detector consisting of a semiconductor quantum dot. We used a model consisting of the…
For any graph $X$ with the adjacency matrix $A$, the transition matrix of the continuous-time quantum walk at time $t$ is given by the matrix-valued function $\mathcal{H}_X(t)=\mathrm{e}^{itA}$. We say that there is perfect state transfer…
We consider a system of qubits coupled via nearest-neighbour interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to $1$. We are interested in determining which graphs allow for a…
We study perfect state transfer in Kendon's model of discrete quantum walks. In particular, we give a characterization of perfect state transfer purely in terms of the graph spectra, and construct an infinite family of $4$-regular circulant…
In 2018, Chen and Godsil proposed the concept of Laplacian perfect pair state transfer which is a brilliant generalization of Laplacian perfect state transfer. In this paper, we study the existence of Laplacian perfect pair state transfer…
The unitary Cayley graph, denoted $X_n$, is the graph with vertex set ${\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u$ for some $u$ with $1 \leq u \leq n-1$ and $\gcd(u,n) = 1$. The quadratic unitary…
A multi-branch quantum circuit is considered from the viewpoint of coherent electron or wave transport. Starting with the closed system, we give analytical conditions for the appearance of two isolated localized states out of the energy…
We derive a necessary condition for the existence of a completely-positive, linear, trace-preserving map which deterministically transforms one finite set of pure quantum states into another. This condition is also sufficient for…
This work deals with quantum graphs, focusing on the transmission properties they engender. We first select two simple diamond graphs, and two hexagonal graphs in which the vertices are all of degree 3, and investigate their transmission…
We show that multipartite quantum states that have a positive partial transpose with respect to all bipartitions of the particles can outperform separable states in linear interferometers. We introduce a powerful iterative method to find…
Heisenberg-type spin models in the limit of a low number of excitations are useful tools to study basic mechanisms in strongly correlated and magnetic systems. Many of these mechanisms can be experimentally tested using ultracold atoms.…
For a system of N identical particles in a random pure state, there is a threshold k_0 = k_0(N) ~ N/5 such that two subsystems of k particles each typically share entanglement if k > k_0, and typically do not share entanglement if k < k_0.…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…