Related papers: Perfect state transfer on bi-Cayley graphs over ab…
The problem of the reliable transfer of entanglement from one pure bipartite quantum state to another using local operations is analyzed. It is shown that in the case of qubits the amount that can be transferred is restricted to the…
In this paper, we investigate the existence of fractional revival on semi-Cayley graphs over finite abelian groups. We give some necessary and sufficient conditions for semi-Cayley graphs over finite abelian groups admitting fractional…
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…
We propose a class of qubit networks that admit perfect transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
The name graph state is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computing, and which has a natural graphical description. We present the…
Perfect code in Cayley graphs and Cayley sum graphs is studied extensively in recent years. In this paper, we consider perfect code in generalized Cayley graphs.
We introduce quantum walks on Cayley graphs of non-Abelian groups. We focus on the easiest case of virtually Abelian groups, and introduce a technique to reduce the quantum walk to an equivalent one on an Abelian group with coin system…
In this paper, we give a necessary and sufficient condition for a subgroup to be a perfect code for finite groups. As an application, we determine all subgroup perfect codes of extraspecial 2-groups and finite groups whose Sylow 2-subgroup…
We study the state transfer through quantum walks placed on a bounded one-dimensional path. We first consider continuous-time quantum walks from a Gaussian state. We find such a state when superposing centered on the starting and antipodal…
In this paper, we investigate the existence of fractional revival on Cayley graphs over finite abelian groups. We give a necessary and sufficient condition for Cayley graphs over finite abelian groups to have fractional revival. As…
In this paper, we study the existence of perfect state transfer and pretty good state transfer in vertex complemented coronas. We prove that perfect state transfer in vertex complemented coronas is extremely rare. In contrast, we give…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with…
The transition matrix of a graph $G$ corresponding to the adjacency matrix $A$ is defined by $H(t):=\exp{\left(-itA\right)},$ where $t\in\mathbb{R}$. The graph is said to exhibit pretty good state transfer between a pair of vertices $u$ and…
For $q\in\mathbb{R}\backslash\{0\}$, the generalized Laplacian of a graph $X$ is the matrix $\mathscr{L}=\Delta+qA$, where $\Delta$ is the degree matrix and $A$ is the adjacency matrix of $X$. In this paper, we investigate perfect state…
The quantum state transmission (QST) through the medium of high-dimensional many-particle system is studied with a symmetry analysis. We discover that, if the spectrum matches the symmetry of a fermion or boson system in a certain fashion,…
We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…
In this paper we build on the ideas presented in previous works for perfectly transferring a quantum state between opposite ends of a spin chain using a fixed Hamiltonian. While all previous studies have concentrated on nearest-neighbor…
We characterize a close connection between the continuous-time quantum-walk model and a discrete-time quantum-walk version, based on the staggered model with Hamiltonians in a class of Cayley graphs, which can be considered as a…
We prove that the empirical density of states of quantum spin glasses on arbitrary graphs converges to a normal distribution as long as the maximal degree is negligible compared with the total number of edges. This extends the recent…