Related papers: Persistent Quantum Memory in Iterated Lifts
Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
We prove analytical results showing that decoherence can be useful for mixing time in a continuous-time quantum walk on finite cycles. This complements the numerical observations by Kendon and Tregenna (Physical Review A 67 (2003), 042315)…
Persistent homology is a cornerstone of topological data analysis, offering a multiscale summary of topology with robustness to nuisance transformations, such as rotations and small deformations. Persistent homology has seen broad use…
Quantum coherence is an essential ingredient in quantum information processing and plays a central role in emergent fields such as nanoscale thermodynamics and quantum biology. However, our understanding and quantitative characterization of…
The lackadaisical quantum walk is a lazy version of a discrete-time, coined quantum walk, where each vertex has a weighted self-loop that permits the walker to stay put. They have been used to speed up spatial search on a variety of graphs,…
We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…
We investigate the construction of coherent states for quantum theories of connections based on graphs embedded in a spatial manifold, as in loop quantum gravity. We discuss the many subtleties of the construction, mainly related to the…
Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked…
The expected hitting time of discrete quantum walks on a hypercube (HC) is numerically known to be exponentially shorter than that of their classical analogs in terms of the scaling with the HC dimension. Recent numerical analyses…
We consider to what extent quantum walks can constitute models of thermalization, analogously to how classical random walks can be models for classical thermalization. In a quantum walk over a graph, a walker moves in a superposition of…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
Quantum coherence is the most fundamental feature of quantum mechanics. The usual understanding of it depends on the choice of the basis, that is, the coherence of the same quantum state is different within different reference framework. To…
This paper proposes to broaden the canonical formulation of quantum mechanics. Ordinarily, one imposes the condition $H^\dagger=H$ on the Hamiltonian, where $\dagger$ represents the mathematical operation of complex conjugation and matrix…
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time…
Extending upon the observations of the emergence of quantum-like states from classical complex synchronized networks, this work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the…
We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…
Hilbert space fragmentation is a novel type of ergodicity breaking in closed quantum systems. Recently, an algebraic approach was utilized to provide a definition of Hilbert space fragmentation characterizing \emph{families} of Hamiltonian…
A quantum graph $\mathcal{G}$ housed by a matrix algebra $M_n$ can be encoded as an operator system $\mathcal S=\mathcal{S}_{\mathcal{G}}\le M_n$. There are two sensible notions of quantum automorphism group for any such:…
Large scale complex systems, such as social networks, electrical power grid, database structure, consumption pattern or brain connectivity, are often modeled using network graphs. Valuable insight can be gained by measuring the similarity…