Related papers: Communication in XYZ All-to-All Quantum Networks w…
We propose a scheme for quantum state transfer(QST) between two qubits which is based on their individual interaction with a common boson environment. The corresponding single mode spin-boson Hamiltonian is solved by mapping it onto a wave…
We systematically study the parity- and time-reversal (PT) symmetric non-Hermitian version of a quantum network proposed in the paper of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)]. The nature of this model shows that it is a…
Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this paper we present a characterization on connected simple Cayley graph $\Gamma={\rm Cay}(G,S)$…
Transferring quantum states efficiently between distant nodes of an information processing circuit is of paramount importance for scalable quantum computing. We report on the first observation of a perfect state transfer protocol on a…
The quantum Perfect State Transfer (PST) is a fundamental tool of quantum communication in a network. It is not easy to achieve in practice. The original idea of PST depends on the fundamentals of the continuous-time quantum walk. A path…
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…
In this paper we answer the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer. The network is described by a circulant graph $G$, which is characterized by its circulant…
The transfer of quantum information between different locations is key to many quantum information processing tasks. Whereas, the transfer of a single qubit state has been extensively investigated, the transfer of a many-body system…
The transmission of quantum states in the anisotropic Heisenberg XXZ chain model with three-spin exchange interaction is studied. The average fidelity is used to evaluate the state transfer. It is found out that quantum communication can be…
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…
Quantum walks on translation invariant regular graphs spread quadratically faster than their classical counterparts. The same coherence that gives them this quantum speedup inhibits, or even stops their spread in the presence of disorder.…
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…
Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of…
A chain of interacting spin behaves like a quantum mediator (quantum link) which allows two distant parties that control the ends of the chain to exchange quantum messages. We show that over repeated uses without resetting the study of a…
In this paper, we study consensus seeking of quantum networks under directed interactions defined by a set of permutation operators among a network of qubits. The state evolution of the quantum network is described by a continuous-time…
Perfect state transfer is significant in quantum communication networks. There are very few graphs having this property. So, it is useful to find some new graphs having perfect state transfer. A good way to construct new graphs is by…
In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer: the transmission of quantum states without dissipation. The essential goal is to…
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…
Quantum state transfer is the act of transferring quantum information from one system in a quantum network to another without physically transporting carriers of quantum information, but instead engineering a Hamiltonian such that the state…
We study translation-invariant quantum spin Hamiltonians on general graphs with non-commuting interactions either given by (i) a random rank-$1$ projection or (ii) Haar projectors. For (i), we prove that the Hamiltonian is gapped on any…