Related papers: Perfect quantum state transfer with spinor bosons …
We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
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…
The transfer of information from one part of a quantum system to another is fundamental to the understanding and design of quantum information processing devices. In the realm of discrete systems such as spin chains, inhomogeneous networks…
The issue of quantum states' transfer -- in particular, for so-called Perfect State Transfer (PST) -- in the networks represented by the spin chains seems to be one of the major concerns in quantum computing. Especially, in the context of…
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,…
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…
In the light of recent advances in fabricating single layer quantum chips and a possible road toward development of multi-layer quantum chips, we review, in a detailed way, the subject of quantum state transfer with particular emphasis on…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with…
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer, but to design a suitable one. We are particularly interested…
Given a graph with Hermitian adjacency matrix $H$, perfect state transfer occurs from vertex $a$ to vertex $b$ if the $(b,a)$-entry of the unitary matrix $\exp(-iHt)$ has unit magnitude for some time $t$. This phenomenon is relevant for…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
The coherent transfer of excitations between different locations of a quantum many-body system is of primary importance in many research areas, from transport properties in spintronics and atomtronics to quantum state transfer in quantum…
A general formalism of the problem of perfect state transfer is presented. We show that there are infinitely many Hamiltonians which may provide solution to this problem. In a first attempt to give a classification of them we investigate…
It is shown how to perfectly transfer an arbitrary qudit state in interacting boson networks. By defining a family of Hamiltonians related to Bose-Hubbard model, we describe a possible method for state transfer through bosonic atoms trapped…
We study a transport phenomenon in certain coined quantum walks where a subspace of states localized at a vertex gets transferred to another vertex. We first develop characterizations for perfect and pretty good subspace state transfer…
Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which…
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 investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-1/2 network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and…
We construct infinite families of graphs in which pretty good state transfer can be induced by adding a potential to the nodes of the graph (i.e. adding a number to a diagonal entry of the adjacency matrix). Indeed, we show that given any…