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

arXiv:0902.1095 · Physical Review A

Perfect state transfer without state initialization and remote collaboration

Marcin Markiewicz, Marcin Wieśniak

Published May 11, 2009• 40 citations
arXivHTMLPDF

Abstract

We present a perfect state transfer protocol via a qubit chain with the evolution governed by the $xx$ Hamiltonian. In contrast to the recent protocol announced in Phys. Rev. Lett. 101, 230502 (2008), our method does not demand any remote-cooperated initialization and sending classical information about measurement outcomes. We achieve the perfect state transfer only with the assumption of access to two spins at each end of the chain, while the initial state of the whole chain is irrelevant.

DOI
10.1103/physreva.79.054304

Related papers

EFFICIENT AND PERFECT STATE TRANSFER IN QUANTUM CHAINS

Daniel Klaus Burgarth, Sougato Bose, Vittorio Giovannetti

We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number of chains employed in the scheme. The system consists of M uncoupled identical quantum chains. Local control (gates, measurements) is only allowed at the sending/receiving end of the chains. Under a quite general hypothesis on the interaction Hamiltonian of the qubits, a theorem can be proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits. We show how two parallel Heisenberg spin chains can be used as quantum wires. Perfect state transfer with a probability of failure lower than P in a Heisenberg chain of N spin-1/2 particles can be achieved in a time scale of the order of [Formula: see text].

International Journal of Quantum Information•Jun 1, 2006•17 citations

Efficient and perfect state transfer in quantum chains

Daniel Klaus Burgarth, Vittorio Giovannetti, Sougato Bose

We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number of chains employed in the scheme. The system consists of M uncoupled identical quantum chains. Local control (gates, measurements) is only allowed at the sending/receiving end of the chains. Under a quite general hypothesis on the interaction Hamiltonian of the qubits, a theorem is proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits.

arXiv:quant-ph/0410175•Journal of Physics A Mathematical and General•Jul 13, 2005•82 citations

PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL

Alastair Kay

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. The perfect state transfer systems are then used as a constructive tool to design Hamiltonian implementations of other primitive protocols such as entanglement generation and signal amplification in measurements, before showing that, in fact, universal quantum computation can be implemented in this way.

arXiv:0903.4274•International Journal of Quantum Information•Jun 1, 2010•348 citations

Remote quantum gates mediated by spin chains

Rebecca Ronke, Irene D’Amico, Timothy P. Spiller

There has been much recent study on the application of spin chains to quantum state transfer and communication. Here we demonstrate that spin chains set up for perfect quantum state transfer can be utilised to generate remote quantum gates, between spin qubits injected at the ends of the chain. The natural evolution of the system across different excitation number sectors generates a maximally-entangling and universal gate between the injected qubits, independent of the length of the chain.

arXiv:1003.0869•Mar 3, 2010•0 citations

Perfect State Transfer on a Spin Chain without State Initialization

Carlo D. Franco, Mauro Paternostro, M. S. Kim

We demonstrate that perfect state transfer can be achieved using an engineered spin chain and clean local end-chain operations, without requiring the initialization of the state of the medium nor fine-tuning of control pulses. This considerably relaxes the prerequisites for obtaining reliable transfer of quantum information across interacting-spin systems. Moreover, it allows us to shed light on the interplay among purity, entanglement, and operations on a class of many-body systems potentially useful for quantum information processing tasks.

arXiv:0805.4365•Physical Review Letters•Dec 3, 2008•148 citations

Perfect transfer of arbitrary states in quantum spin networks

Matthias Christandl, Nilanjana Datta, T. C. Dorlas +3 more

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, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to $N$-qubit spin networks of identical qubit couplings, we show that $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{3}N$ is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).

arXiv:quant-ph/0411020•Physical Review A•Mar 14, 2005•527 citations
We present a perfect state transfer protocol via a qubit chain with the evolution governed by the xxxxxx Hamiltonian. In contrast to the recent protocol announced in Phys. Rev. Lett. 101, 230502 (2008), our method does not demand any remote-cooperated initialization and sending classical information about measurement outcomes. We achieve the perfect state transfer only with the assumption of access to two spins at each end of the chain, while the initial state of the whole chain is irrelevant.
We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number of chains employed in the scheme. The system consists of M uncoupled identical quantum chains. Local control (gates, measurements) is only allowed at the sending/receiving end of the chains. Under a quite general hypothesis on the interaction Hamiltonian of the qubits, a theorem can be proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits. We show how two parallel Heisenberg spin chains can be used as quantum wires. Perfect state transfer with a probability of failure lower than P in a Heisenberg chain of N spin-1/2 particles can be achieved in a time scale of the order of [Formula: see text].
We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number of chains employed in the scheme. The system consists of M uncoupled identical quantum chains. Local control (gates, measurements) is only allowed at the sending/receiving end of the chains. Under a quite general hypothesis on the interaction Hamiltonian of the qubits, a theorem is proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits.
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. The perfect state transfer systems are then used as a constructive tool to design Hamiltonian implementations of other primitive protocols such as entanglement generation and signal amplification in measurements, before showing that, in fact, universal quantum computation can be implemented in this way.
We demonstrate that perfect state transfer can be achieved using an engineered spin chain and clean local end-chain operations, without requiring the initialization of the state of the medium nor fine-tuning of control pulses. This considerably relaxes the prerequisites for obtaining reliable transfer of quantum information across interacting-spin systems. Moreover, it allows us to shed light on the interplay among purity, entanglement, and operations on a class of many-body systems potentially useful for quantum information processing tasks.
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, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to NNN-qubit spin networks of identical qubit couplings, we show that 2log3N2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{3}N2log3​N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).