Related papers: Average mixing of continuous quantum walks
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…
We show that for a family of quantum walk models with electric fields, the spectrum is the unit circle for any irrational field. The result also holds for the associated CMV matrices defined by skew-shifts. Generalizations to CMV matrices…
In this paper a storage method and a context-aware circuit simulation idea are presented for the sum of block diagonal matrices. Using the design technique for a generalized circuit for the Hamiltonian dynamics through the truncated series,…
The statistical properties of quantum transport through a chaotic cavity are encoded in the traces $\T={\rm Tr}(tt^\dag)^n$, where $t$ is the transmission matrix. Within the Random Matrix Theory approach, these traces are random variables…
Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration.…
A uniform matrix product state defined on a tripartite system of spins, denoted by $ABC,$ is shown to be an approximate quantum Markov chain when the size of subsystem $B,$ denoted $|B|,$ is large enough. The quantum conditional mutual…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
We study the scattering of particles and quasiparticles in the framework of algebraic quantum field theory. The main novelty is the construction of inclusive scattering matrix related to inclusive cross-sections. The inclusive scattering…
We study discrete time Markov processes with periodic or open boundary conditions and with inhomogeneous rates in the bulk. The Markov matrices are given by the inhomogeneous transfer matrices introduced previously to prove the…
The Schur product of two complex m x n matrices is their entry wise product. We show that an extremal element X in the convex set of m x n complex matrices of Schur multiplier norm at most 1 satisfies the inequality rank(X) =< (m +n)^(1/2)…
In this paper, we consider the sharp interface limit of a matrix-valued Allen-Cahn equation, which takes the form: $$\partial_t A=\Delta A-\varepsilon^{-2}( A A^{\mathrm{T}}A-…
We consider a Grover walk model on a finite internal graph, which is connected with a finite number of semi-infinite length paths and receives the alternative inflows along these paths at each time step. After the long time scale, we know…
Given a unital C*-algebra A, an injective endomorphism \alpha:A --> A preserving the unit, and a conditional expectation E from A to the range of \alpha we consider the crossed-product of A by \alpha relative to the transfer operator…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
Let $(X_t)_{t = 0 }^{\infty}$ be an irreducible reversible discrete time Markov chain on a finite state space $\Omega $. Denote its transition matrix by $P$. To avoid periodicity issues (and thus ensuring convergence to equilibrium) one…
For \Gamma a countable amenable group consider those actions of \Gamma as measure-preserving transformations of a standard probability space, written as {T_\gamma}_{\gamma \in \Gamma} acting on (X,{\cal F}, \mu). We say…
We consider a random bistochastic matrix of size $n$ of the form $M Q$ where $M$ is a uniformly distributed permutation matrix and $Q$ is a given bistochastic matrix. Under mild sparsity and regularity assumptions on $Q$, we prove that the…
The outcomes of a series of measurements, made on a quantum system, form a sequence of random events which occur in a particular order. The system, together with a meter or meters, can be seen as following the paths of a stochastic network…
A diagrammatic method is presented for averaging over the circular ensemble of random-matrix theory. The method is applied to phase-coherent conduction through a chaotic cavity (a ``quantum dot'') and through the interface between a normal…
In this research article, we design a quantum hash function model from hybrid quantum walks on finite path graph. The hybrid evolution operator consisting of integrated framework of continuous time quantum walks and lackadaisical quantum…