Related papers: Space-efficient Quantization Method for Reversible…

We study a discrete-time quantum walk (QW) on the line with a single phase at the origin which was introduced and studied by Wojcik et al.[1]. We call the model "Wojcik model" here. Konno et al.[2] investigated other types of QWs with one…

Existence of the eigenvalues of the discrete-time quantum walks is deeply related to localization of the walks. We revealed the distributions of the eigenvalues given by the splitted generating function method (the SGF method) of the…

We propose a new model for a measurement of a characteristic of a microscopic quantum state by a large system that selects stochastically the different eigenstates with appropriate quantum weights. Unlike previous works which formulate a…

We analyze random walks on a class of semigroups called ``left-regular bands''. These walks include the hyperplane chamber walks of Bidigare, Hanlon, and Rockmore. Using methods of ring theory, we show that the transition matrices are…

In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum random walks. The quantum Markov chain, like the classical Markov chain, is a fundamental tool for the investigation of the basic properties such…

As cloud services continue to expand, the security of private data stored and processed in these environments has become paramount. This work delves into quantum homomorphic encryption (QHE), an emerging technology that facilitates secure…

We consider a one-dimensional space-inhomogeneous discrete time quantum walk. This model is the Hadamard walk with one defect at the origin which is different from the model introduced by Wojcik et al. [14]. We obtain a stationary measure…

Random walk sampling methods have been widely used in graph sampling in recent years, while it has bias towards higher degree nodes in the sample. To overcome this deficiency, classical methods such as MHRW design weighted walking by…

Lackadaisical quantum walk(LQW) has been an efficient technique in searching a target state from a database which is distributed on a two-dimensional lattice. We numerically study the quantum search algorithm based on the lackadaisical…

We study a quantum walk (QW) whose time evolution is induced by a random walk (RW) first introduced by Szegedy (2004). We focus on a relation between recurrent properties of the RW and localization of the corresponding QW. We find the…

In this work we focus on the notion of quantum hitting time for discrete-time Szegedy quantum walks, compared to its classical counterpart. Under suitable hypotheses, quantum hitting time is known to be of the order of the square root of…

Multi-dimensional quantum walks usually require large coin spaces. Here we show that the non-localized case of the spatial density probability of the two-dimensional Grover walk can be obtained using only a two-dimensional coin space and a…

In this paper, we analyze the application of the Multi-self-loop Lackadaisical Quantum Walk on the hypercube that uses partial phase inversion to search for multiple adjacent marked vertices. We evaluate the influence of the relative…

The rotation of subspaces by a chosen angle is a fundamental quantum computing operation, with applications in error correction and quantum algorithms such as the Quantum Approximate Optimization Algorithm, the Variational Quantum…

Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. The general model of coined QWM is presented in Phys. Rev. A 93, 042323 (2016). In this paper, we present general model of Szegedy…

Quantum walks contribute significantly to developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional quantum walk in the $d$-dimensional quantum domain, where $d>2$, and show its…

In this paper, we consider a spectral analysis of discrete time quantum walks on the path. For isospectral coin cases, we show that the time averaged distribution and stationary distributions of the quantum walks are described by the pair…

Coined Quantum Walks (QWs) are being used in many contexts with the goal of understanding quantum systems and building quantum algorithms for quantum computers. Alternative models such as Szegedy's and continuous-time QWs were proposed…

Markov chain methods are remarkably successful in computational physics, machine learning, and combinatorial optimization. The cost of such methods often reduces to the mixing time, i.e., the time required to reach the steady state of the…

In a recent work by Novo et al. (Sci. Rep. 5, 13304, 2015), the invariant subspace method was applied to the study of continuous-time quantum walk (CTQW). The method helps to reduce a graph into a simpler version that allows more…