Related papers: Pair State Transfer
Chains of transmon qubits are considered promising systems to implement different quantum information tasks. In particular as channels that perform high-quality quantum state transfer. We study how changing the interaction strength between…
We investigate the quantum state transfer in a chain of particles satisfying q-deformed oscillators algebra. This general algebraic setting includes the spin chain and the bosonic chain as limiting cases. We study conditions for perfect…
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,…
In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex Hadamard matrices. We give some basic properties and…
An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer ($\PST$ for short) and multiple state…
In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
We discuss pretty good state transfer of multiple qubit states and provide a model for considering state transfer of arbitrary states on unmodulated XX-type spin chains. We then provide families of paths and initial states for which we can…
Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of…
We present a conceptually new approach to describe state-of-the-art photonic quantum experiments using Graph Theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that…
Spin chains can realise perfect quantum state transfer between the two ends via judicious choice of coupling strengths. In this paper, we study what other states can be created by engineering a spin chain. We conclude that, up to local…
We study transfer of single photon in an one-dimensional finite Glauber-Fock cavity array whose coupling strengths satisfy a square root law. The evolved state in the array can be mapped to an upper truncated coherent state if the cavities…
In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one dimensional cases, such as 1d spin chains. We…
This work presents an exactly soluble scheme to address the problem of optimal transfer of quantum states through a set of $s$ harmonic oscillators composing a network with connected ends as a closed quantum circuit. For this purpose we…
A quantum walk model which reflects the $2$-cell embedding on the orientable closed surface of a graph in the dynamics is introduced. We show that the scattering matrix is obtained by finding the faces on the underlying surface which have…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
In this work, we consider the spatial search for a general marked state on graphs by continuous time quantum walks. As a simplest case, we compute the amplitude expression of the search for the multi-vertex uniform superposition state on…
We show that deciding whether a graph admits perfect state transfer can be done in polynomial time with respect to the size of the graph on a classical computer.
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
We formalize the treatment of directed (or chiral) quantum walks using Hermitian adjacency matrices, bridging two developing fields of research in quantum information and spectral graph theory. We display results and simulations which…