Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Shanxi University

A New Scheme on Realizing Quantum Information Transfer

Qing-Liang Wang

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

The single state information transfer was studied and a new scheme was introduced.The Hamiltonian,we adopt,is modified Heisenberg XX model which describes a nearest-neighbor interaction in spin chain.When λt is relative small,the evolution operator can be made Talor spread and then we can determine that the exponential of spreading item is taken N-1,where N is the number of the lattice in spin chain.We can obtain the probability amplitude of single state information transfer from one side to the other:|F(t)|=|(-iλt/2)|N-1=1.Then the single state information can be perfectly transferred in spin chain as long as we take the proper time t.

Related papers

Quantum communication and state transfer in spin chains

Joris Van Der Jeugt

We investigate the time evolution of a single spin excitation state in certain linear spin chains, as a model for quantum communication. We consider first the simplest possible spin chain, where the spin chain data (the nearest neighbour interaction strengths and the magnetic field strengths) are constant throughout the chain. The time evolution of a single spin state is determined, and this time evolution is illustrated by means of an animation. Some years ago it was discovered that when the spin chain data are of a special form so-called perfect state transfer takes place. These special spin chain data can be linked to the Jacobi matrix entries of Krawtchouk polynomials or dual Hahn polynomials. We discuss here the case related to Krawtchouk polynomials, and illustrate the possibility of perfect state transfer by an animation showing the time evolution of the spin chain from an initial single spin state. Very recently, these ideas were extended to discrete orthogonal polynomials of q -hypergeometric type. Here, a remarkable result is a new analytic model where perfect state transfer is achieved: this is when the spin chain data are related to the Jacobi matrix of q -Krawtchouk polynomials. This case is discussed here, and again illustrated by means of an animation.

Journal of Physics Conference Series•Mar 1, 2011•3 citations

Spin chains as perfect quantum state mirrors

P. Karbach, Joachim Stolze

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 shown to exist in two models with specifically designed strongly inhomogeneous couplings. We show that perfect transfer occurs in an entire class of chains, including systems whose nearest-neighbor couplings vary only weakly along the chain. The key to these observations is the Jordan-Wigner mapping of spins to noninteracting lattice fermions that display perfectly periodic dynamics if the single-particle energy spectrum is appropriate. After a half-period of that dynamics, any state is transformed into its mirror image with respect to the center of the chain. The absence of fermion interactions preserves these features at an arbitrary temperature and allows for the transfer of nontrivially entangled states of several spins or qubits.

arXiv:quant-ph/0501007•Physical Review A•Sep 29, 2005•215 citations

Transfer of arbitrary two-qubit states via a spin chain

Salvatore Lorenzo, Tony J. G. Apollaro, Simone Paganelli +2 more

We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-$\frac{1}{2}$ network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and that a fully polarized initial state is taken for the lattice, we obtain a general formula for the average fidelity of the two qubits QST, linking it to the one- and two-particle transfer amplitudes of the spin excitations among the sites of the lattice. We then apply this formalism to a 1D spin chain with $XX$-Heisenberg type nearest-neighbour interactions adopting a protocol that is a generalization of the single qubit one proposed in Paganelli et al. [Phys. Rev. A 87, 062309 (2013)]. We find that a high-quality two qubit QST can be achieved provided one can control the local fields at sites near the sender and receiver. Under such conditions, we obtain an almost perfect transfer in a time that scales either linearly or, depending on the spin number, quadratically with the length of the chain.

arXiv:1502.02458•Physical Review A•Apr 16, 2015•56 citations

Perfect state transfer: Beyond nearest-neighbor couplings

Alastair Kay

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 couplings, we demonstrate how to incorporate additional terms in the Hamiltonian by solving an inverse eigenvalue problem. We also explore issues relating to the choice of the eigenvalue spectrum of the Hamiltonian, such as the tolerance to errors and the rate of information transfer.

arXiv:quant-ph/0509065•Physical Review A•Mar 3, 2006•140 citations

Conclusive and arbitrarily perfect quantum state transfer using amplitude delaying spin chain channels

Daniel Klaus Burgarth, Sougato Bose

We suggest a protocol for the transfer of quantum information in spin chain channels with a finite recurrence time. By combining a dual-rail encoding with certain measurements at the receiving end, we can get arbitrarily perfect state transfer, i.e. by performing sufficiently many measurements at the receiving end, we can make the probability of perfect state transfer arbitrary close to unity. As an example of such an amplitude delaying channel, we show how two parallel Heisenberg spin chains can be used as quantum wires in solid state quantum computers. Perfect state transfer with a probability of failure lower than delta in a Heisenberg chain of N spin-1/2 particles can be achieved in a timescale of the order of N^(7/3)*|ln(delta)|. Furthermore, the same scheme can be implemented using a single SU(n) chain which is realizable in quantum dot arrays.

•Jun 15, 2004•0 citations

Conclusive quantum-state transfer with a single randomly coupled spin chain

Jiankui He, Qing Chen, Lei Ding +1 more

We studied the quantum state transfer in randomly coupled spin chains. By using local memories storing the information and dividing the task into transfer portion and decoding portion, conclusive transfer was ingeniously achieved with just one single spin chain. In our scheme, the probability of successful transfer can be made arbitrary close to unity. Especially, our scheme is a good protocol to decode information from memories without adding another spin chain. Compared with Time-reversed protocol, the average decoding time is much less in our scheme.

arXiv:quant-ph/0606088•Jun 9, 2006•0 citations
The single state information transfer was studied and a new scheme was introduced.The Hamiltonian,we adopt,is modified Heisenberg XX model which describes a nearest-neighbor interaction in spin chain.When λt is relative small,the evolution operator can be made Talor spread and then we can determine that the exponential of spreading item is taken N-1,where N is the number of the lattice in spin chain.We can obtain the probability amplitude of single state information transfer from one side to the other:|F(t)|=|(-iλt/2)|N-1=1.Then the single state information can be perfectly transferred in spin chain as long as we take the proper time t.
We investigate the time evolution of a single spin excitation state in certain linear spin chains, as a model for quantum communication. We consider first the simplest possible spin chain, where the spin chain data (the nearest neighbour interaction strengths and the magnetic field strengths) are constant throughout the chain. The time evolution of a single spin state is determined, and this time evolution is illustrated by means of an animation. Some years ago it was discovered that when the spin chain data are of a special form so-called perfect state transfer takes place. These special spin chain data can be linked to the Jacobi matrix entries of Krawtchouk polynomials or dual Hahn polynomials. We discuss here the case related to Krawtchouk polynomials, and illustrate the possibility of perfect state transfer by an animation showing the time evolution of the spin chain from an initial single spin state. Very recently, these ideas were extended to discrete orthogonal polynomials of q -hypergeometric type. Here, a remarkable result is a new analytic model where perfect state transfer is achieved: this is when the spin chain data are related to the Jacobi matrix of q -Krawtchouk polynomials. This case is discussed here, and again illustrated by means of an animation.
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 shown to exist in two models with specifically designed strongly inhomogeneous couplings. We show that perfect transfer occurs in an entire class of chains, including systems whose nearest-neighbor couplings vary only weakly along the chain. The key to these observations is the Jordan-Wigner mapping of spins to noninteracting lattice fermions that display perfectly periodic dynamics if the single-particle energy spectrum is appropriate. After a half-period of that dynamics, any state is transformed into its mirror image with respect to the center of the chain. The absence of fermion interactions preserves these features at an arbitrary temperature and allows for the transfer of nontrivially entangled states of several spins or qubits.
We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-12\frac{1}{2}21​ network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and that a fully polarized initial state is taken for the lattice, we obtain a general formula for the average fidelity of the two qubits QST, linking it to the one- and two-particle transfer amplitudes of the spin excitations among the sites of the lattice. We then apply this formalism to a 1D spin chain with XXXXXX-Heisenberg type nearest-neighbour interactions adopting a protocol that is a generalization of the single qubit one proposed in Paganelli et al. [Phys. Rev. A 87, 062309 (2013)]. We find that a high-quality two qubit QST can be achieved provided one can control the local fields at sites near the sender and receiver. Under such conditions, we obtain an almost perfect transfer in a time that scales either linearly or, depending on the spin number, quadratically with the length of the chain.
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 couplings, we demonstrate how to incorporate additional terms in the Hamiltonian by solving an inverse eigenvalue problem. We also explore issues relating to the choice of the eigenvalue spectrum of the Hamiltonian, such as the tolerance to errors and the rate of information transfer.
We suggest a protocol for the transfer of quantum information in spin chain channels with a finite recurrence time. By combining a dual-rail encoding with certain measurements at the receiving end, we can get arbitrarily perfect state transfer, i.e. by performing sufficiently many measurements at the receiving end, we can make the probability of perfect state transfer arbitrary close to unity. As an example of such an amplitude delaying channel, we show how two parallel Heisenberg spin chains can be used as quantum wires in solid state quantum computers. Perfect state transfer with a probability of failure lower than delta in a Heisenberg chain of N spin-1/2 particles can be achieved in a timescale of the order of N^(7/3)*|ln(delta)|. Furthermore, the same scheme can be implemented using a single SU(n) chain which is realizable in quantum dot arrays.
We studied the quantum state transfer in randomly coupled spin chains. By using local memories storing the information and dividing the task into transfer portion and decoding portion, conclusive transfer was ingeniously achieved with just one single spin chain. In our scheme, the probability of successful transfer can be made arbitrary close to unity. Especially, our scheme is a good protocol to decode information from memories without adding another spin chain. Compared with Time-reversed protocol, the average decoding time is much less in our scheme.