Related papers: Perfect quantum state transfer with spinor bosons …
Spin chains have been proposed as wires to transport information between distributed registers in a quantum information processor. Unfortunately, the challenges in manufacturing linear chains with engineered couplings has hindered…
Perfect state transfer (PST) is discussed in the context of passive quantum networks with logical bus topology, where many logical nodes communicate using the same shared media, without any external control. The conditions under which, a…
High-fidelity quantum computation and quantum state transfer are possible in short spin chains. We exploit a system based on a dispersive qubit-boson interaction to mimic XY coupling. In this model, the usually assumed nearest-neighbors…
We propose a quantum network consisting of optical waveguides in the linear regime for quantum state transfer. The circular topology of our network introduces novel functionalities that enable us to analytically identify the conditions…
We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a…
We introduce a scheme for perfect state transfer in regular two and three dimensional structures. The interactions on the lattices are of XX spin type with uniform couplings. In two dimensions the structure is a hexagonal lattice and in…
The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this…
We study perfect state transfer in Grover walks, which are typical discrete-time quantum walk models. In particular, we focus on states associated to vertices of a graph. We call such states vertex type states. Perfect state transfer…
We present a method that implement directional, perfect state transfers within a branched spin network by exploiting quantum interferences in the time-domain. That provides a tool to isolate subsystems from a large and complex one.…
Spin-1 systems, in comparison to spin-1/2 systems, offer a better security for encoding and transfer of quantum information, primarily due to their larger Hilbert spaces. Superconducting artificial atoms possess multiple energy-levels,…
We investigate quantum state transfer on a class of bipartite graphs, namely the butterfly graphs, within the framework of discrete-time quantum walks. These graphs facilitate the construction of scalable quantum networks that enable…
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…
The existence of perfect state transfer (PST) on quantum spin networks is a fundamental problem in mathematics and physics. Various works in the literature have explored PST in graphs with arithmetic origins, such as gcd-graphs over…
Quantum state transfer is an important task in quantum information processing. It is known that one can engineer the couplings of a one-dimensional spin chain to achieve the goal of perfect state transfer. To leverage the value of these…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
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…
We prove that almost-linear-time high-fidelity state transfer is achievable in a quantum spin chain using loop weights at the second and second-to-last nodes. We provide specific parameter values, and using a careful analysis of the…
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,…