Related papers: Quantum routing in planar graph using perfect stat…
We propose a hypercube switching architecture for the perfect state transfer (PST) where we prove that it is always possible to find an induced hypercube in any given hypercube of any dimension such that PST can be performed between any two…
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 study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs with $2^k$ $\left(k\in\mathbb{Z}\right)$ vertices exhibit…
The last decade has witnessed substantial interest in protocols for transferring information on networks of quantum mechanical objects. A variety of control methods and network topologies have been proposed, on the basis that transfer with…
We review the subject of perfect state transfer; how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time.…
In this paper we build on the ideas presented in previous works for perfectly transferring a quantum state between opposite ends of a spin chain using a fixed Hamiltonian. While all previous studies have concentrated on nearest-neighbor…
We explore the physical mechanism to coherently transfer the quantum information of spin by connecting two spins to an isotropic antiferromagnetic spin ladder system as data bus. Due to a large spin gap existing in such a perfect medium,…
Spin chains can be used to describe a wide range of platforms for quantum computation and quantum information. They enable the understanding, demonstration, and modeling of numerous useful phenomena, such as high fidelity transfer of…
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…
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…
Quantum state transfer is an important task in quantum information processing. It is known that one can engineer the couplings of a one-dimensional spin chain to achieve the goal of perfect state transfer. To leverage the value of these…
We propose a method for Hamiltonian engineering in quantum information processing architectures that requires no local control, but only relies on collective qubit rotations and field gradients. The technique achieves a spatial modulation…
We suggest a protocol for perfect quantum communication through spin chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
In loop quantum gravity approach to Planck scale physics, quantum geometry is represented by superposition of the so-called spin network states. In the recent literature, a class of spin networks promising from the perspective of quantum…
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…
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…
Routing quantum information among different nodes in a network is a fundamental prerequisite for a quantum internet. While single-qubit routing has been largely addressed, many-qubit routing protocols have not been intensively investigated…
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…