Related papers: Quantum state transfer via the ferromagnetic chain…
We propose a scheme for using a spin chain with fixed symmetry interaction as a channel for perfect quantum communication. The perfect quantum communication is determined by the eigenvalues that form a special arithmetical progression, the…
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…
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…
Effective state transfer is one of the most important problems in quantum information processing. Typically, a quantum information device is composed of many subsystems with multi-input ports. In this paper, we develop a general theory…
By analytically solving the master equation, we investigate quantum state transfer, creation and distribution of entanglement in the model of Milburn's intrinsic decoherence. Our results reveal that the ideal spin channels will be destroyed…
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…
We investigate quantum state transfer in XY spin chains and propose a recursive procedure to construct the nonuniform couplings of these chains with arbitrary length to achieve perfect state transfer(PST). We show that this method is…
Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which…
The existence of perfect state transfer (PST) on quantum spin networks is a fundamental problem in mathematics and physics. Various works in the literature have explored PST in graphs with arithmetic origins, such as gcd-graphs over…
Semiconductor quantum-dot spin qubits are a promising platform for quantum computation, because they are scalable and possess long coherence times. In order to realize this full potential, however, high-fidelity information transfer…
Heisenberg exchange coupling between neighboring electron spins in semiconductor quantum dots provides a powerful tool for quantum information processing and simulation. Although so far unrealized, extended Heisenberg spin chains can enable…
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…
We propose a hybrid cavity magnomechanical system to realize and transfer the bipartite entanglements and Einstein-Podolsky-Rosen (EPR) steerings between magnons, photons, and phonons in the regime of stability of the system. As a…
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex…
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit…
We present a protocol for quantum state transfer and remote state preparation across spin chains which operate in their anti-ferromagnetic mode. The proposed mechanism harnesses the inherent entanglement of the ground state of the strongly…
We show how nanostructuring of a metallic gate on a field-effect transistor (FET) can lead to a macroscopic, robust and voltage controlled quantum state in the electron channel of a FET. A chain of triple quantum dot molecules created by…
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…
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…
We prove new results on perfect state transfer of quantum walks on quotient graphs. Since a graph $G$ has perfect state transfer if and only if its quotient $G/\pi$, under any equitable partition $\pi$, has perfect state transfer, we…