Related papers: Perfect State Transfer in Two and Three Dimensiona…
We present a general scheme for implementing bi-directional quantum state transfer in a quantum swapping channel. Unlike many other schemes for quantum computation and communication, our method does not require qubit couplings to be…
Quantum state transfer (QST) describes the coherent passage of quantum information from one node in a network to another. Experiments on QST span a diverse set of platforms and currently report transport across up to tens of nodes in times…
The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another.…
This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association…
Efficient quantum-state transfer is achieved in a uniformly coupled spin-1/2 chain, with open boundaries, by application of local magnetic fields on the second and last-but-one spins, respectively. These effective \textit{barriers} induce…
State transfer is a well-known routine for various systems of spins-$\frac{1}2$. Still, it is not well studied for chains of spins of larger magnitudes. In this contribution we argue that while perfect state transfer may seem unnatural in…
For a graph $G$ and a related symmetric matrix $M$, the continuous-time quantum walk on $G$ relative to $M$ is defined as the unitary matrix $U(t) = \exp(-itM)$, where $t$ varies over the reals. Perfect state transfer occurs between…
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…
Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H_{A}(t):=\exp{(-itA)},\;t\in\Rl$. We say that the graph $G$ admits perfect state transfer between the verteices $u$ and $v$ at…
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…
We consider a spin network resembling an $\alpha$-helix structure and study quantum information transfer over this bio-inspired network. The model we use is the Davydov model in its elementary version without a phononic environment. We…
The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this…
We demonstrate mesoscopic transport through quantum states in quasi-1D lattices maintaining the combination of parity and time-reversal symmetries by controlling energy gain and loss. We investigate the phase diagram of the non-Hermitian…
We propose a method to construct universal order parameters for quantum phase transitions in many-body lattice systems. The method exploits the $H$-orthogonality of a few near-degenerate lowest states of the Hamiltonian describing a given…
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 show how to achieve perfect quantum state transfer and construct effective two-qubit gates between distant sites in engineered bosonic and fermionic networks. The Hamiltonian for the system can be determined by choosing an eigenvalue…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
A globally controlled scheme for quantum transport is proposed. The scheme works on a 1D chain of nearest neighbor coupled systems of qudits (finite dimension), or qunats (continuous variable), taking any arbitrary initial quantum state of…
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…
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…