Related papers: Quantum Fractional Revival on Graphs
Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, "consume" entangled quantum states during their execution. When participants are located at distant sites, these…
Recurrence time quantifies the duration required for a physical system to return to its initial state, playing a pivotal role in understanding the predictability of complex systems. In quantum systems with subspace measurements, recurrence…
As nature is ascribed as quantum, the fractals also pose some intriguing appearance which is found in many micro and macro observable entities or phenomena. Fractals show self-similarity across sizes; structures that resemble the entire are…
Recurrence in the classical random walk is well known and described by the P\'olya number. For quantum walks, recurrence is similarly understood in terms of the probability of a localized quantum walker to return to its origin. Under…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
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…
Complex networks have certain properties that distinguish them from their respective uniform or regular counterparts. One of these properties is the variation of topological properties along different hierarchical levels. In this work, we…
Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover…
Quantum many-fermion systems give rise to diverse states of matter that often reveal themselves in distinctive transport properties. While some of these states can be captured by microscopic models accessible to numerical exact quantum…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
In this review, we present some fundamental classical and quantum phenomena in view of time fractional formalism. Time fractional formalism is a very useful tool in describing systems with memory and delay. We hope that this study can…
Motivated by a recent application of quantum graphs to model the anomalous Hall effect we discuss quantum graphs the vertices of which exhibit a preferred orientation. We describe an example of such a vertex coupling and analyze the…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…
The phase ordering dynamics of coupled chaotic maps on fractal networks are investigated. The statistical properties of the systems are characterized by means of the persistence probability of equivalent spin variables that define the…
The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods,…
Classical and quantum walks on some finite paths are introduced. It is shown that these walks have explicit solutions given in terms of exceptional Krawtchouk polynomials and their properties are explored. In particular, fractional revival…
A two-state master equation based decision making model has been shown to generate phase transitions, to be topologically complex and to manifest temporal complexity through an inverse power-law probability distribution function in the…
We numerically analyse quantum survival probability fluctuations in an open, classically chaotic system. In a quasi-classical regime, and in the presence of classical mixed phase space, such fluctuations are believed to exhibit a fractal…
Transport experiments provide conflicting evidence on the possible existence of fractional order within integer quantum Hall systems. In fact integer edge states sometimes behave as monolithic objects with no inner structure, while other…