Related papers: Perfect edge state transfer on cubelike graphs
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…
For a graph $G$ and a related symmetric matrix $M$, the continuous-time quantum walk on $G$ relative to $M$ is defined as the unitary matrix $U(t) = \exp(-itM)$, where $t$ varies over the reals. Perfect state transfer occurs between…
We demonstrate that perfect state transfer can be achieved using an engineered spin chain and clean local end-chain operations, without requiring the initialization of the state of the medium nor fine tuning of control-pulses. This…
We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number chains employed in the scheme. The system consists of $M$ uncoupled…
This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association…
Effective state transfer is one of the most important problems in quantum information processing. Typically, a quantum information device is composed of many subsystems with multi-input ports. In this paper, we develop a general theory…
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by…
In this paper, we first give a necessary and sufficient condition for a graph to have Laplacian pretty good pair state transfer. As an application of such result, we give a complete characterization of Laplacian pretty good edge state…
In the light of recent advances in fabricating single layer quantum chips and a possible road toward development of multi-layer quantum chips, we review, in a detailed way, the subject of quantum state transfer with particular emphasis on…
Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure…
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…
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…
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…
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…
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…
We show how to achieve perfect quantum state transfer and construct effective two-qubit gates between distant sites in engineered bosonic and fermionic networks. The Hamiltonian for the system can be determined by choosing an eigenvalue…
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 show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit…
The \textit{transition matrix} of a graph $\Gamma$ with adjacency matrix $A$ is defined by $H(\tau ) := \exp(-\mathbf{i}\tau A)$, where $\tau \in \mathbb{R}$ and $\mathbf{i} = \sqrt{-1}$. The graph $\Gamma$ exhibits \textit{perfect state…
Quantum state transfer, first introduced by Bose in 2003, is an important physical phenomenon in quantum networks, which plays a vital role in quantum communication and quantum computing. In 2004, Christandl et al. proposed the concept of…