Related papers: Arbitrary perfect state transfer in $d$-level spin…
We study the existence of state transfer with respect to the $q$-Laplacian matrix of a graph equipped with a non-trivial involution. We show that the occurrence of perfect state transfer between certain pair (or plus) states in such a graph…
We consider a spin network resembling an $\alpha$-helix structure and study quantum information transfer over this bio-inspired network. The model we use is the Davydov model in its elementary version without a phononic environment. We…
The transfer of quantum states has played an important role in quantum information processing. In fact, transfer of quantum states from point $A$ to $B$ with unit fidelity is very important for us and we focus on this case. In recent years,…
Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed…
We study the problem of mapping an unknown mixed quantum state onto a known pure state without the use of unitary transformations. This is achieved with the help of sequential measurements of two non-commuting observables only. We show that…
A continuous quantum walk on a graph $X$ with adjacency matrix $A$ is specified by the 1-parameter family of unitary matrices $U(t)=\exp(itA)$. These matrices act on the state space of a quantum system, the states of which we may represent…
In this letter we propose a superadiabatic protocol where quantum state transfer can be achieved with arbitrarily high accuracy and minimal control across long spin chains with an odd number of spins. The quantum state transfer protocol…
The behavior of quantum states at exceptional points and at critical points associated with quantum phase transitions is intriguing yet puzzling. In this study, we present an alternative method for obtaining the Berry potentials using the…
We calculate the propagator and the transition probabilities for a coherently driven three-state quantum system. The energies of the three states change linearly in time, whereas the interactions between them are pulse-shaped. We derive a…
A systematic study of fractional revival at two sites in $XX$ quantum spin chains is presented and analytic models with this phenomenon are exhibited. The generic models have two essential parameters and a revival time that does not depend…
A continuous-time quantum walk on a graph $X$ is represented by the complex matrix $\exp (-\mathrm{i} t A)$, where $A$ is the adjacency matrix of $X$ and $t$ is a non-negative time. If the graph models a network of interacting qubits,…
A simple method for transmitting quantum states within a quantum computer is via a quantum spin chain---that is, a path on $n$ vertices. Unweighted paths are of limited use, and so a natural generalization is to consider weighted paths;…
We show that using a slightly modified XX model for a spin-1/2 chain, one can transmit almost perfectly a maximally entangled two-qubit state from one end of the chain to the other one. This is accomplished without external fields or…
In this work, we study transfer of coherence matrices along spin-1/2 chains of various length. Unlike higher order coherence matrices, 0-order coherence matrix can be perfectly transferred if its elements are properly fixed. In certain…
We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which…
The production of quantum states required for use in quantum protocols & technologies is studied by developing the tools to re-engineer a perfect state transfer spin chain so that a separable input excitation is output over multiple sites.…
Motivated by the need for communication of coherent state-based qubits in quantum computers, we introduce a method for perfect transferring of an arbitrary superposition of coherent states between two distant nodes of a linear array of…
Suppose a quantum system starts to evolve under a Hamiltonian from some initial state. When for the first time, will an observable attain a preassigned value? To answer this question, one method often adopted is to make instantaneous…
A general formalism of the problem of perfect state transfer is presented. We show that there are infinitely many Hamiltonians which may provide solution to this problem. In a first attempt to give a classification of them we investigate…
Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which…