相关论文: Quantum-inspired Hash Function Based on Parity-dep…
We consider the effect of different unitary noise mechanisms on the evolution of a quantum walk (QW) on a linear chain with a generic coin operation: (i) bit-flip channel noise, restricted to the coin subspace of the QW, and (ii)…
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
Quantum walks behave differently from what we expect and their probability distributions have unique structures. They have localization, singularities, a gap, and so on. Those features have been discovered from the view point of mathematics…
This paper examines the stability of the quantum random walk search algorithm, when the walk coin is constructed by generalized Householder reflection and additional phase shift, against inaccuracies in the phases used to construct the…
Quantization and asymptotic behaviour of a variant of discrete random walk on integers are investigated. This variant, the $\epsilon_{V^{k}}$ walk, has the novel feature that it uses many identical quantum coins keeping at the same time…
In this tutorial, which contains some original results, we bridge the fields of quantum computing algorithms, conservation laws, and many-body quantum systems by examining three algorithms for searching an unordered database of size $N$…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
We investigate a novel quantum random walk (QRW) model, possibly useful in quantum algorithm implementation, that achieves a quadratically faster diffusion rate compared to its classical counterpart. We evaluate its asymptotic behavior…
We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…
We show that a quantum walk process can be used to construct and secure quantum memory. More precisely, we show that a localized quantum walk with temporal disorder can be engineered to store the information of a single, unknown qubit on a…
Quantum Physical Unclonable Functions (QPUFs) offer a physically grounded approach to secure authentication, extending the capabilities of classical PUFs. This review covers their theoretical foundations and key implementation challenges -…
We develop a novel method for measuring the similarity between complete weighted graphs, which are probed by means of discrete-time quantum walks. Directly probing complete graphs using discrete-time quantum walks is intractable due to the…
We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert…
We study quantum coherence in continuous-time quantum walks on perfect graphs generated by the symmetric lift ${\mathrm{HL}}'_2(G)$, a canonical, unweighted, undirected construction defined as the line graph of a bipartite double cover of…
For the ever-growing field of quantum information processing, large-scale, efficient multi-port interferometers serving as photonic processors are required. In this context, the suitability of quantum walks as the interferometric base for…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
In discrete-time quantum walk (DTQW) the walker's coin space entangles with the position space after the very first step of the evolution. This phenomenon may be exploited to obtain the value of the coin parameter $\theta$ by performing…
We propose a novel heuristic quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs). In this framework, the coherent propagation of a quantum walker over a graph encodes its structural…
The quantum switch, a process enabling a coherent superposition of different orders of quantum channels, has garnered significant attention due to its ability to enable noiseless communications through noisy channels, such as…