Related papers: Perfect quantum state transfer on the Johnson sche…
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,…
Given a graph $G$ with vertex set $V(G)=\{v_1,v_2,\ldots,v_{n_1}\}$ and a graph $H$ of order $n_2$, the vertex complemented corona, denoted by $G\tilde{\circ}{H}$, is the graph produced by copying $H$ $n_1$ times, with the $i$-th copy of…
A recent numerical study of short chains found near-perfect quantum state transfer between the boundary sites of a spin-1/2 XX chain if a sufficiently strong magnetic field acts on these sites. We show that the phenomenon is based on a pair…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
Search and state transfer between hubs, i.e. fully connected vertices, on otherwise arbitrary connected graph is investigated. Motivated by a recent result of Razzoli et al. (J. Phys. A: Math. Theor. 55, 265303 (2022)) on universality of…
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…
By using some techniques such as spectral distribution and stratification associated with the graphs, employed in [1,2] for the purpose of Perfect state transfer (PST) of a single qubit over antipodes of distance-regular spin networks and…
We study the continuous-time quantum walks on graphs in the adjacency algebra of the $n$-cube and its related distance regular graphs. For $k\geq 2$, we find graphs in the adjacency algebra of $(2^{k+2}-8)$-cube that admit instantaneous…
We suggest a protocol for perfect quantum communication through spin chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success…
We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles C_4, C_6 and C_8 for three choices of coin operator. Perfect state transfer was found, in general, to be…
We propose a strategy for perfect state transfer in spin chains based on the use of an unmodulated coupling Hamiltonian whose coefficients are explicitly time dependent. We show that, if specific and non-demanding conditions are satisfied…
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…
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…
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…
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 propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties,…
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 study perfect state transfer and multiple state transfer in oriented normal Cayley graphs. We construct examples in a variety of groups, ranging from abelian to nonsolvable, and establish some general restrictions and nonexistence…
Given two graphs $G_{1}$ of order $n_{1}$ and $G_{2}$, the neighborhood corona of $G_{1}$ and $G_{2}$, denoted by $G_{1}\bigstar G_{2}$, is the graph obtained by taking one copy of $G_{1}$ and taking $n_{1}$ copies of $G_{2}$, in the…
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…