Related papers: Perfect state transfer over distance-regular spin …
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
Perfect state transfer is significant in quantum communication networks. There are very few graphs having this property. So, it is useful to find some new graphs having perfect state transfer. A good way to construct new graphs is by…
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…
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…
Using a global optimization algorithm we obtain spin chains with site-dependent exchange coefficients which allow almost perfect quantum state transfer between the extremes of the chains without any further time-dependent external control.…
This article is devoted to the development of analytical and numerical approaches to the problem of the end-to-end quantum state transfer along the spin-1/2 chain using two methods: (a) a homogeneous spin chain with week end bonds and equal…
The last decade has witnessed substantial interest in protocols for transferring information on networks of quantum mechanical objects. A variety of control methods and network topologies have been proposed, on the basis that transfer with…
We exploit a ferromagnetic chain of interacting $d$-level ($d>2$) particles for arbitrary perfect transfer of quantum states with $(d-1)$ levels. The presence of one extra degree of freedom in the Hilbert space of particles, which is not…
We present a general formalism to the problem of perfect state-transfer (PST), where the state involves multiple excitations of the quantum network. A key feature of our formalism is that it allows for inclusion of nontrivial interactions…
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in…
Quantum state transfer (QST) describes the coherent passage of quantum information from one node in a network to another. Experiments on QST span a diverse set of platforms and currently report transport across up to tens of nodes in times…
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…
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk…
Quantum state transfer is a fundamental requirement for scalable quantum computation, where fast and reliable communication between distant subsystems is essential. In this work, we present a protocol for quantum state transfer in linear…
We propose a strategy for perfect state transfer in spin chains based on the use of an unmodulated coupling Hamiltonian whose coefficients are explicitly time dependent. We show that, if specific and non-demanding conditions are satisfied…
We study perfect state transfer in Kendon's model of discrete quantum walks. In particular, we give a characterization of perfect state transfer purely in terms of the graph spectra, and construct an infinite family of $4$-regular circulant…
In recent years, significant progress has been made in the field of state transfer in spin chains, with the aim of achieving perfect state transfer for quantum information processing applications. Previous research has mainly focused on…
We find analytic models that can perfectly transfer, without state initializati$ or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. We elaborate on a possible…
A new solvable two-dimensional spin lattice model defined on a regular grid of triangular shape is proposed. The hopping amplitudes between sites are related to recurrence coefficients of certain bivariate dual-Hahn polynomials. For a…
The basic idea of spin chain engineering for perfect quantum state transfer (QST) is to find a set of coupling constants in the Hamiltonian, such that a particular state initially encoded on one site will evolve freely to the opposite site…