Related papers: Switching and partially switching the hypercube wh…
Search and state transfer between hubs, i.e. fully connected vertices, on otherwise arbitrary connected graph is investigated. Motivated by a recent result of Razzoli et al. (J. Phys. A: Math. Theor. 55, 265303 (2022)) on universality of…
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…
Quantum state transfer is a fundamental requirement for scalable quantum computation, where fast and reliable communication between distant subsystems is essential. In this work, we present a protocol for quantum state transfer in linear…
The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…
The basic idea of spin chain engineering for perfect quantum state transfer (QST) is to find a set of coupling constants in the Hamiltonian, such that a particular state initially encoded on one site will evolve freely to the opposite site…
We present a statistical analysis on the performance of a protocol for the faithful transfer of a quantum state in finite qubit or spin chains, in the presence of diagonal and off-diagonal disorder. It is shown that the average-state…
We characterize perfect state transfer on real-weighted graphs of the Johnson scheme $\mathcal{J}(n,k)$. Given $\mathcal{J}(n,k)=\{A_1, A_2, \cdots, A_k\}$ and $A(X) = w_0A_0 + \cdots + w_m A_m$, we show, using classical number theory…
The evolution of certain pair state in a quantum network with isomorphic branches, governed by the Heisenberg $XY$ Hamiltonian, depends solely on the local structure, and it remains unaffected even if the global structure is altered. All…
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…
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…
In this paper, we give some sufficient conditions for graphs with an edge perturbation between twin vertices to have Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer. By those sufficient conditions,…
We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for…
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 show how to perfectly transfer, without state initialization and remote collaboration, arbitrary functions in interacting boson lattices. We describe a possible implementation of state transfer through bosonic atoms trapped in optical…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
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…
Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…
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…
The natural notion of almost perfect state transfer (APST) is examined. It is applied to the modelling of efficient quantum wires with the help of $XX$ spin chains. It is shown that APST occurs in mirror-symmetric systems, when the…
The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and adding a new edge between two new vertices which lie on adjacent edges of $G$. In this…