Discrete quantum walk is one of the de facto models of quantum computation and as an efficient tool to develop quantum search algorithms. Although the theoretical model of quantum walks is straightforward, there are many complex scenarios such as coherence decay and/or decoherence in the implementations. It is hard to test experimentally if quantum walk works, or it just decays into a version of classic random walk. We propose a quantum central limit theorem (QCLT) for discrete quantum walks and conduct the statistical hypothesis testing for the standard or decayed walker probability distribution for imperfect quantum walks based on the QCLT. A reliable statistical analysis result is obtained for the imperfect distribution by the experimental quantum walk study.
Discrete quantum walk is one of the de facto models of quantum computation and as an efficient tool to develop quantum search algorithms. Although the theoretical model of quantum walks is straightforward, there are many complex scenarios such as coherence decay and/or decoherence in the implementations. It is hard to test experimentally if quantum walk works, or it just decays into a version of classic random walk. We propose a quantum central limit theorem (QCLT) for discrete quantum walks and conduct the statistical hypothesis testing for the standard or decayed walker probability distribution for imperfect quantum walks based on the QCLT. A reliable statistical analysis result is obtained for the imperfect distribution by the experimental quantum walk study.
Since a limit distribution of a discrete-time quantum walk on the line was derived in 2002, a lot of limit theorems for quantum walks with a localized initial state have been reported. On the other hand, in quantum probability theory, there are four notions of independence (free, monotone, commuting, and boolean independence) and quantum central limit theorems associated to each independence have been investigated. The relation between quantum walks and quantum probability theory is still unknown. As random walks are fundamental models in the Kolmogorov probability theory, can the quantum walks play an important role in quantum probability theory? To discuss this problem, we focus on a discrete-time 2-state quantum walk with a non-localized initial state and present a limit theorem. By using our limit theorem, we generate probability laws in the quantum central limit theorems from the quantum walk.
Since a limit distribution of a discrete-time quantum walk on the line was derived in 2002, a lot of limit theorems for quantum walks with a localized initial state have been reported. On the other hand, in quantum probability theory, there are four notions of independence (free, monotone, commuting, and boolean independence) and quantum central limit theorems associated to each independence have been investigated. The relation between quantum walks and quantum probability theory is still unknown. As random walks are fundamental models in the Kolmogorov probability theory, can the quantum walks play an important role in quantum probability theory? To discuss this problem, we focus on a discrete-time 2-state quantum walk with a non-localized initial state and present a limit theorem. By using our limit theorem, we generate probability laws in the quantum central limit theorems from the quantum walk.
Open Quantum Random Walks, as developed in \cite{APSS}, are a quantum generalization of Markov chains on finite graphs or on lattices. These random walks are typically quantum in their behavior, step by step, but they seem to show up a rather classical asymptotic behavior, as opposed to the quantum random walks usually considered in Quantum Information Theory (such as the well-known Hadamard random walk). Typically, in the case of Open Quantum Random Walks on lattices, their distribution seems to always converge to a Gaussian distribution or a mixture of Gaussian distributions. In the case of nearest neighbors homogeneous Open Quantum Random Walks on $\ZZ^d$ we prove such a Central Limit Theorem, in the case where only one Gaussian distribution appears in the limit. Through the quantum trajectory point of view on quantum master equations, we transform the problem into studying a certain functional of a Markov chain on $\ZZ^d$ times the Banach space of quantum states. The main difficulty is that we know nothing about the invariant measures of this Markov chain, even their existence. Surprisingly enough, we are able to produce a Central Limit Theorem with explicit drift and explicit covariance matrix. The interesting point which appears with our construction and result is that it applies actually to a wider setup: it provides a Central Limit Theorem for the sequence of recordings of the quantum trajectories associated to any completely positive map. This is what we show and develop as an application of our result. In a second step we are able to extend our Central Limit Theorem to the case of several asymptotic Gaussians, in the case where the operator coefficients of the quantum walk are block-diagonal in a common basis.
Discrete-time quantum walks are considered a counterpart of random walks and their study has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to two parts. The quantum walker with two coin states spreads at points, represented by integers, and we analyze the chance of finding the walker at each position after it carries out a unitary evolution a lot of times. The result is reported as a long-time limit distribution from which one can see an approximation to the finding probability.
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with the Hamiltonian-driven time evolution of continuous walks. Through systematic analysis of probability distributions, standard deviations, and entanglement entropy on fundamental graph structures, we reveal distinctive dynamical characteristics that differentiate our model from conventional quantum walk paradigms. The proposed framework demonstrates unifying capabilities by naturally encompassing existing quantum walk models as special cases. Two significant applications emerge from this hybrid architecture: (1) We develop a novel protocol for perfect state transfer(PST) in general connected graphs, overcoming the limitations of previous graph-specific approaches. A PST on a tree graph has been implemented on a quantum superconducting processor. (2) We devise a quantum algorithm for multiplying K adjacency matrices of n -vertex regular graphs with time complexity O ( n 2 d 1 ⋯ d K ), outperforming classical matrix multiplication ( O ( n 2.371552 )) when vertex degrees d i are bounded. The algorithm’s efficacy for triangle counting is experimentally validated through the quantum simulation on PennyLane. These results establish the hybrid quantum walk as a versatile framework bridging discrete and continuous paradigms while enabling practical quantum advantage in graph computation tasks.
Open Quantum Random Walks are the exact quantum generalization of Markov chains on finite graphs or on nets. These random walks are typically quantum in their behavior, step by step, but they seem to show up a rather classical asymptotic behavior, as opposed to the quantum random walks usually considered in Quantum Information Theory (such as the well-known Hadamard random walk). Typically, in the case of Open Quantum Random Walks on nets, their distribution seems to always converges to a Gaussian distribution or a mixture of Gaussian distributions. In the case of nearest neighbors homogeneous Open Quantum Random Walks on Z^d we prove such a Central Limit Theorem, in the case where only one Gaussian distribution appears in the limit. Through the quantum trajectory point of view on quantum master equations, we transform the problem into studying a certain functional of a Markov chain on Z^d times the Banach space of quantum states. The main difficulty is that we know nothing about the invariant measures of this Markov chain, even their existence. Surprisingly enough, we are able to produce a Central Limit Theorem with explicit drift and explicit covariance matrix. In a second step we are able to extend our Central Limit Theorem to the case of several asymptotic Gaussians, in the case where the operator coefficients of the quantum walk are block-diagonal in a common basis.