Related papers: Peak state transfer in continuous quantum walks
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 study perfect state transfer in Kendon's model of discrete quantum walks. In particular, we give a characterization of perfect state transfer purely in terms of the graph spectra, and construct an infinite family of $4$-regular circulant…
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…
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…
The transfer of data is a fundamental task in information systems. Microprocessors contain dedicated data buses that transmit bits across different locations and implement sophisticated routing protocols. Transferring quantum information…
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…
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…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties,…
In this paper, we study pretty good state transfer (PGST) in Grover walks on graphs. We consider transfer of quantum states that are localized at the vertices of a graph and we use Chebyshev polynomials to analyze PGST between such states.…
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…
The transfer of quantum information between different locations is key to many quantum information processing tasks. Whereas, the transfer of a single qubit state has been extensively investigated, the transfer of a many-body system…
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 study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs. The latter class is a generalization of the former. We first give a complete classification of…
We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator…
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 study quantum state transfer through a qubit network modeled by spins with XY interaction, when relying on a single excitation. We show that it is possible to achieve perfect transfer by shifting (adding) energy to specific vertices.…
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…
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…