Related papers: Perfect quantum state transfer on the Johnson sche…
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…
We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit…
Twin vertices in simple unweighted graphs are vertices that have the same neighbours and, in the case of weighted graphs with possible loops, the corresponding incident edges have equal weights. In this paper, we explore the role of twin…
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…
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…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…
As generalizations of results of Christandl et al.\cite{8,9""} and Facer et al.\cite{Facer}, Bernasconi et al.\cite{godsil,godsil1} studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of…
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…
We investigate coined quantum walk search and state transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition. First, it is shown that by adding a loop to each vertex the search algorithm finds the…
We study the time evolution of a single spin excitation state in certain linear spin chains, as a model for quantum communication. Some years ago it was discovered that when the spin chain data (the nearest neighbour interaction strengths…
The evolution of certain pair state in a quantum network with isomorphic branches, governed by the Heisenberg $XY$ Hamiltonian, depends solely on the local structure, and it remains unaffected even if the global structure is altered. All…
This paper discusses continuous-time quantum walks and asymptotic state transfer in graphs with an involution. By providing quantitative bounds on the eigenvectors of the Hamiltonian, it provides an approach to achieving high-fidelity state…
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…
The total graph of a graph $G$, denoted $\mathcal{T}(G)$, is defined as the graph whose vertex set is the union of the vertex set of $G$ and the edge set of $G$, such that two vertices of $\mathcal{T}(G)$ are adjacent if the corresponding…
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…
We prove that the only trees that admit perfect state transfer according to the adjacency matrix model are $P_2$ and $P_3$. This answers a question first asked by Godsil in 2012 and proves a conjecture by Coutinho and Liu from 2015.
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…
We investigate quantum state transfer on a class of bipartite graphs, namely the butterfly graphs, within the framework of discrete-time quantum walks. These graphs facilitate the construction of scalable quantum networks that enable…
We introduce a scheme for perfect state transfer in regular two and three dimensional structures. The interactions on the lattices are of XX spin type with uniform couplings. In two dimensions the structure is a hexagonal lattice and in…
We study a continous-time quantum walk on a path graph. In this paper, we show that, for any odd prime $p$ and positive integer $t$, the path on $2^t p - 1$ vertices admits pretty good state transfer between vertices $a$ and $n+1-a$ for…