Related papers: No Laplacian Perfect State Transfer in Trees
We consider the representation of a continuous-time quantum walk in a graph $X$ by the matrix $\exp(itA(X))$. We provide necessary and sufficient criteria for distance-regular graphs and, more generally, for graphs in association schemes to…
The question of perfect state transfer existence in quantum spin networks based on weighted graphs has been recently presented by many authors. We give a simple condition for characterizing weighted circulant graphs allowing perfect state…
Quantum walks generated by the adjacency matrix or the Laplacian are known to exhibit low transfer fidelity on general graphs. In this paper, we study continuous-time quantum walks governed by the generalized Laplacian operator L_k = A+kD,…
We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number chains employed in the scheme. The system consists of $M$ uncoupled…
In this work, we use the Hamiltonian of a modified Dzyaloshinskii-Moriya model and investigate the perfect transfer of the quantum state on the spin networks. In this paper, we calculate fidelity in which fidelity depends on magnetic field…
We show how to perfectly transfer, without state initialization and remote collaboration, arbitrary functions in interacting boson lattices. We describe a possible implementation of state transfer through bosonic atoms trapped in optical…
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…
In this work we show that the simple Hamiltonians used in Quantum Graphity models are highly degenerate, having multiple ground states that are not lattices. In order to assess the distance of the resulting graphs from a lattice graph, we…
By considering distance-regular graphs as spin networks, first we introduce some particular spin Hamiltonians which are extended version of those of Refs.\cite{8,9''}. Then, by using spectral analysis techniques and algebraic combinatoric…
Quantum information transfer is an important part of quantum information processing. Several proposals for quantum information transfer along linear arrays of nearest-neighbor coupled qubits or spins were made recently. Perfect transfer was…
In this paper, we consider the problem on the existence of perfect state transfer(PST for short) on semi-Cayley graphs over abelian groups (which are not necessarily regular), i.e on the graphs having semiregular and abelian subgroups of…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
In this paper, we give some sufficient conditions for graphs with an edge perturbation between twin vertices to have Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer. By those sufficient conditions,…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
Perfect state transfer in graphs is a concept arising from quantum physics and quantum computing. Given a graph $G$ with adjacency matrix $A_G$, the transition matrix of $G$ with respect to $A_G$ is defined as $H_{A_{G}}(t) =…
We demonstrate that perfect state transfer can be achieved in an optical waveguide lattice governed by a Hamiltonian with modulated nearest-neighbor couplings. In particular, we report the condition that the evolution Hamiltonian should…
Perfect state transfer is significant in quantum communication networks. There are very few graphs having this property. So, it is useful to find some new graphs having perfect state transfer. A good way to construct new graphs is by…
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…
The transfer of quantum states has played an important role in quantum information processing. In fact, transfer of quantum states from point $A$ to $B$ with unit fidelity is very important for us and we focus on this case. In recent years,…
We consider the geometry of quantum states associated with different classes of random matrix Hamiltonians, in particular ensembles that show integrability to chaotic transition in terms of the nearest neighbour energy level spacing…