Related papers: Perfect state transfer on graphs with a potential
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…
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…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
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,…
We examine transmission through a quantum graph vertex to which auxiliary edges with constant potentials are attached. We find a characterization of vertex couplings for which the transmission probability from a given "input" line to a…
We investigate the effect of disorder on the transfer of quantum states across a one-dimensional lattice with varying levels of control resources. We find that the application of properly designed control signals, even when applied only to…
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.…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on $n$ vertices with an edge removed and attached to two leads, to represent the entrance and exit channels, from where we calculate the…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
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…
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…
For $q\in\mathbb{R}\backslash\{0\}$, the generalized Laplacian of a graph $X$ is the matrix $\mathscr{L}=\Delta+qA$, where $\Delta$ is the degree matrix and $A$ is the adjacency matrix of $X$. In this paper, we investigate perfect state…
Although a complete picture of the full evolution of complex quantum systems would certainly be the most desirable goal, for particular Quantum Information Processing schemes such an analysis is not necessary. When quantum correlations…
We describe a protocol for perfectly transferring a quantum state from one party to another under the dynamics of a fixed, engineered Hamiltonian. Our protocol combines the concepts of fractional revival, dual rail encoding, and a rare…
The transfer of data is a fundamental task in information systems. Microprocessors contain dedicated data buses that transmit bits across different locations and implement sophisticated routing protocols. Transferring quantum information…
We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
We investigate quantum and nonsignaling generalizations of perfect matchings in graphs using nonlocal games. Specifically, we introduce nonlocal games that test for $L$-perfect matchings in bipartite graphs, perfect matchings in general…
Quantum walks on graphs are fundamental to quantum computing and have led to many interesting open problems in algebraic graph theory. This review article highlights three key classes of open problems in this domain; perfect state transfer,…