Related papers: Pretty good state transfer in graphs with an invol…
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…
The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge. In this paper we…
By considering distance-regular graphs as spin networks, first we introduce some particular spin Hamiltonians which are extended version of those of Refs.\cite{8,9''}. Then, by using spectral analysis techniques and algebraic combinatoric…
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 study scattering for continuous-time quantum walks on finite graphs with two attached leads. We derive explicit formulae for the two-terminal scattering matrix in terms of characteristic polynomials of the finite graph and its…
Quantum effects are known to provide an advantage in particle transfer across networks. In order to achieve this advantage, requirements on both a graph type and a quantum system coherence must be found. Here we show that the process of…
We propose a hypercube switching architecture for the perfect state transfer (PST) where we prove that it is always possible to find an induced hypercube in any given hypercube of any dimension such that PST can be performed between any two…
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,…
High fidelity state transfer is an important ingredient of distributed quantum information processing. We present and analyse results on perfect and quasi-perfect state transfer with linear spin chains incorporating non-uniform on-site…
The issue of quantum states' transfer -- in particular, for so-called Perfect State Transfer (PST) -- in the networks represented by the spin chains seems to be one of the major concerns in quantum computing. Especially, in the context of…
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. {\bf 101}, 230502 (2008)], our method does not demand any…
For many quantum information protocols such as state transfer, entanglement transfer and entanglement generation, standard notions of controllability for quantum systems are too strong. We introduce the weaker notion of accessible pairs,…
We demonstrate that perfect state transfer can be achieved in an optical waveguide lattice governed by a Hamiltonian with modulated nearest-neighbor couplings. In particular, we report the condition that the evolution Hamiltonian should…
A method for high-fidelity quantum state transfer in a quantum network coupled to a continuum, based on time reversal in the continuum after decay, is theoretically suggested. Provided that the energy spectrum of the network is symmetric…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
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.…
Achieving quantum state transfer in passive ways can become a powerful asset for scalable quantum networks. Here, we demonstrate how giant atoms coupled to 1D waveguides provide a platform for such a passive, deterministic transfer.…
Superconducting quantum circuits, fabricated with multiple layers, are proposed to implement perfect quantum state transfer between nodes of a hypercube network. For tunable devices such as the phase qubit, each node can transmit quantum…
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every…
We construct the exact solution for a family of one-half spin chains explicitly. The spin chains Hamiltonian corresponds to an isotropic Heisenberg Hamiltonian, with staggered exchange couplings that take only two different values. We work…