Related papers: Perfect state transfer via quantum probability the…
Quantum state transfer along a one-dimensional spin chain has become a fundamental ingredient for quantum communication between distant nodes in a quantum network. We study the average fidelity of quantum state transfer (QST) along a XY…
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…
We study a quantum state transfer between spins interacting with an arbitrary network of spins coupled by uniform XX interactions. It is shown that in such a system under fairly general conditions, we can expect a nearly perfect transfer of…
In this work, we use the Hamiltonian of a modified Dzyaloshinskii-Moriya model and investigate the perfect transfer of the quantum state on the spin networks. In this paper, we calculate fidelity in which fidelity depends on magnetic field…
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 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…
Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a…
A quantum network requires information transfer between distant quantum computers, which would enable distributed quantum information processing and quantum communication. One model for such a network is based on the probabilistic…
The dynamical behavior of a coupled cavity array is investigated when each cavity contains a three-level atom. For the uniform and staggered intercavity hopping, the whole system Hamiltonian can be analytically diagonalized in the subspace…
The transmission of quantum information between different parts of a quantum computer is of fundamental importance. Spin chains have been proposed as quantum channels for transferring information. Different configurations for the spin…
We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit…
By adopting the concept of fidelity, we investigated efficiency of quantum state transfer with the XX chain as the quantum channel. Different from the previous works, we concentrated on effects of spin and magnetic impurity on fidelity of…
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…
We show how two many-body, generally mixed, quantum states can be swapped via collective, all-to-all interactions. Specifically, we present an experimentally relevant implementation for quantum dots that enables coherent exchange of quantum…
In this paper we address the problem of optimal reconstruction of a quantum state from the result of a single measurement when the original quantum state is known to be a member of some specified set. A suitable figure of merit for this…
It is shown how to systematically construct the $XX$ quantum spin chains with nearest-neighbor interactions that allow perfect state transfer (PST). Sets of orthogonal polynomials (OPs) are in correspondence with such systems. The key…
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties,…
Building a quantum repeater network for long distance quantum communication requires photons and quantum registers that comprise qubits for interaction with light, good memory capabilities and processing qubits for storage and manipulation…
Designing a good transfer channel for arbitrary quantum states in spin chains implies optimizing a cost function, usually the averaged fidelity of transmission. The fidelity of transmission measures how much the transferred state resembles…
This work recollects a non-universal set of quantum gates described by higher-dimensional Spin groups. They are also directly related with matchgates in theory of quantum computations and complexity. Various processes of quantum state…