Related papers: Spectra of Perfect State Transfer Hamiltonians on …
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an…
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in…
We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. Specific results we prove include: (1) The signed join of a negative 2-clique with any positive…
We introduce and study peak state transfer, a notion of high state transfer in qubit networks modeled by continuous-time quantum walks. Unlike perfect or pretty good state transfer, peak state transfer does not require fidelity arbitrarily…
A continuous-time quantum walk on a graph $X$ is represented by the complex matrix $\exp (-\mathrm{i} t A)$, where $A$ is the adjacency matrix of $X$ and $t$ is a non-negative time. If the graph models a network of interacting qubits,…
We show that a qubit transfer protocol can be realized through a flat band hosted by a disordered $XX$ spin-1/2 diamond chain. In the absence of disorder, the transmission becomes impossible due to the compact localized states forming the…
Using graphs with clusters, we provide a unified approach for constructing graphs with pair state transfer-relative to the adjacency, Laplacian, and signless Laplacian matrix-between the same pair of states at the same time, despite being…
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 consider the Fibonacci Hamiltonian, the central model in the study of electronic properties of one-dimensional quasicrystals, and provide a detailed description of its spectrum and spectral characteristics (namely, the optimal H\"older…
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…
Quantum walks, an important tool in quantum computing, have been very successfully investigated using techniques in algebraic graph theory. We are motivated by the study of state transfer in continuous-time quantum walks, which is…
We systematically study the parity- and time-reversal (PT) symmetric non-Hermitian version of a quantum network proposed in the paper of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)]. The nature of this model shows that it is a…
We present a Hamiltonian that can be used for amplifying the signal from a quantum state, enabling the measurement of a macroscopic observable to determine the state of a single spin. We prove a general mapping between this Hamiltonian and…
The spectral properties of disordered fully-connected graphs with a special type of the node-node interactions are investigated. The approximate analytical expression for the ensemble-averaged spectral density for the Hamiltonian defined on…
Let $X$ be a graph on $n$ vertices with with adjacency matrix $A$ and let $H(t)$ denote the matrix-valued function $\exp(iAt)$. If $u$ and $v$ are distinct vertices in $X$, we say perfect state transfer from $u$ to $v$ occurs if there is a…
This review presents recent developments in the study of inhomogeneous XX spin chains, highlighting results on perfect state transfer, out-of-equilibrium stationary dynamics in open systems, and entanglement and correlations in ground…
The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time…
In this paper we answer the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer. The network is described by a circulant graph $G$, which is characterized by its circulant…
We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which…