Related papers: Pretty good plus state transfer in cycles
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…
This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…
We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the…
Resilience is a concept of rising interest in computer science and software engineering. For systems in which correctness w.r.t. a safety condition is unachievable, fast recovery is demanded. We investigate resilience problems of graph…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
Quantum walks generated by the adjacency matrix or the Laplacian are known to exhibit low transfer fidelity on general graphs. In this paper, we study continuous-time quantum walks governed by the generalized Laplacian operator L_k = A+kD,…
In this article, we give characterization for existence of quantum fractional revival in unitary Cayley graph utilizing adjacency matrix Hamiltonian. Unitary Cayley graph $X=( Z_n, S)$ is a special graph as connection set $S \subseteq Z_n$…
Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
A continuous-time quantum walk on a graph $G$ is given by the unitary matrix $U(t) = \exp(-itA)$, where $A$ is the Hermitian adjacency matrix of $G$. We say $G$ has pretty good state transfer between vertices $a$ and $b$ if for any…
The exponential family of random graphs has been a topic of continued research interest. Despite the relative simplicity, these models capture a variety of interesting features displayed by large-scale networks and allow us to better…
Motivated by recent interests in fracton topological phases, we explore the interplay between gapped 2D $\mathbb{Z}_N$ topological phases which admit fractional excitations with restricted mobility and geometry of the lattice on which such…
We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
Classical results in sparse recovery guarantee the exact reconstruction of $s$-sparse signals under assumptions on the dictionary that are either too strong or NP-hard to check. Moreover, such results may be pessimistic in practice since…
We consider a system of qubits coupled via nearest-neighbour interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to $1$. We are interested in determining which graphs allow for a…
If $X$ is a graph with adjacency matrix $A$, then we define $H(t)$ to be the operator $\exp(itA)$. We say that we have perfect state transfer in $X$ from the vertex $u$ to the vertex $v$ at time $\tau$ if the $uv$-entry of…