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:1106.4829 · Physical Review A

Perfect quantum state transfer in two- and three-dimensional structures

Vahid Karimipour, M. Sarmadi Rad, M. Asoudeh

Published Jan 4, 2012• 33 citations
arXivHTMLPDF

Abstract

We introduce a scheme for perfect state transfer in regular two- and three-dimensional structures. The interactions on the lattices are of the $XX$ spin type with uniform couplings. In two dimensions, the structure is a hexagonal lattice, and in three dimensions, it consists of hexagonal planes joined to each other at arbitrary points. We will show that compared to other schemes, much less control is needed for routing, the algebra of global control is quite simple, and the same kind of control can upload and download qubit states to or from built-in read-write heads.

DOI
10.1103/physreva.85.010302

Related papers

Perfect function transfer in two and three dimensions without initialization

Lian-Ao Wu, Mark Byrd, Z. D. Wang +1 more

We find analytic models that can perfectly transfer, without state initialization or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. This provides for the possible experimental implementation of state transfer through bosonic or fermionic atoms trapped in optical lattices. A significant finding is that the state of a spin qubit can be perfectly transferred through a fermionic system. Families of Hamiltonians are described that are related to the linear models and that enable the perfect transfer of arbitrary functions. Furthermore, we propose methods for eliminating certain types of errors.

arXiv:1004.0010•Physical Review A•Nov 30, 2010•5 citations

Perfect Quantum Routing in Regular Spin Networks

Peter J. Pemberton-Ross, Alastair Kay

Motivated by the need for quantum computers to communicate between multiple, well separated qubits, we introduce the task of quantum routing for distributing quantum states, and generating entanglement, between these sites. We describe regular families of coupled quantum networks which perfectly route qubits between arbitrary pairs of nodes with a high transmission rate. The ability to route multiple states simultaneously and the regularity of the networks vastly improve the utility of this scheme in comparison to the task of state transfer, leading us to propose an implementation in optical lattices.

arXiv:1007.2786•Physical Review Letters•Jan 13, 2011•81 citations

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•16 citations

Engineering Perfect State Transfer Graphs via Givens Transformations

Pablo Serra, Alejandro Ferrón, Omar Osenda

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 homogeneous interactions. These restrictions allow finding numerous examples of systems that show perfect transfer but in geometries that are not implementable or are very difficult to implement in actual experimental settings. Relaxing the homogeneity of the interactions and inspired by the $XX$ qubit chains that show perfect transmission, we present a simple scheme based on the Givens Transformations to analyse and obtain a class of qubit graphs that possess perfect quantum state transmission. We present some simple examples and show how it is possible to generalize them for longer transmission lengths.

quant-pharXiv:2604.02536•Journal of Physics A Mathematical and Theoretical•Apr 6, 2026•0 citations

All possible coupling schemes in XY spin chains for perfect state transfer

Yaoxiong Wang, Feng Shuang, HERSCHEL A. RABITZ

We investigate quantum state transfer in $\mathit{XY}$ spin chains and propose a recursive procedure to construct the nonuniform couplings within these chains of arbitrary length in order to achieve perfect state transfer. We show that this method is capable of finding all possible coupling schemes for perfect state transfer. These schemes, without external control fields, involve analytically identified engineered couplings without the need for dynamical control. The analytical solutions provide all information for coupling design.

arXiv:1101.1156•Physical Review A•Jul 8, 2011•33 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•519 citations
We introduce a scheme for perfect state transfer in regular two- and three-dimensional structures. The interactions on the lattices are of the XXXXXX spin type with uniform couplings. In two dimensions, the structure is a hexagonal lattice, and in three dimensions, it consists of hexagonal planes joined to each other at arbitrary points. We will show that compared to other schemes, much less control is needed for routing, the algebra of global control is quite simple, and the same kind of control can upload and download qubit states to or from built-in read-write heads.
We find analytic models that can perfectly transfer, without state initialization or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. This provides for the possible experimental implementation of state transfer through bosonic or fermionic atoms trapped in optical lattices. A significant finding is that the state of a spin qubit can be perfectly transferred through a fermionic system. Families of Hamiltonians are described that are related to the linear models and that enable the perfect transfer of arbitrary functions. Furthermore, we propose methods for eliminating certain types of errors.
Motivated by the need for quantum computers to communicate between multiple, well separated qubits, we introduce the task of quantum routing for distributing quantum states, and generating entanglement, between these sites. We describe regular families of coupled quantum networks which perfectly route qubits between arbitrary pairs of nodes with a high transmission rate. The ability to route multiple states simultaneously and the regularity of the networks vastly improve the utility of this scheme in comparison to the task of state transfer, leading us to propose an implementation in optical lattices.
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].
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 homogeneous interactions. These restrictions allow finding numerous examples of systems that show perfect transfer but in geometries that are not implementable or are very difficult to implement in actual experimental settings. Relaxing the homogeneity of the interactions and inspired by the XXXXXX qubit chains that show perfect transmission, we present a simple scheme based on the Givens Transformations to analyse and obtain a class of qubit graphs that possess perfect quantum state transmission. We present some simple examples and show how it is possible to generalize them for longer transmission lengths.
We investigate quantum state transfer in XY\mathit{XY}XY spin chains and propose a recursive procedure to construct the nonuniform couplings within these chains of arbitrary length in order to achieve perfect state transfer. We show that this method is capable of finding all possible coupling schemes for perfect state transfer. These schemes, without external control fields, involve analytically identified engineered couplings without the need for dynamical control. The analytical solutions provide all information for coupling design.
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).