Related papers: Circuit Implementation and Analysis of a Quantum-W…
How self-loops on vertices affect quantum walks is an interesting issue, and self-loops play important roles in quantum walk based algorithms. However, the original model that adjusting the effect of self-loops by changing their number has…
In this paper, we introduce a multidimensional generalization of Kitagawa's split-step discrete-time quantum walk, study the spectrum of its evolution operator for the case of one defect coins, and prove localization of the walk. Using a…
We utilize the theory of local amplitude transfers (LAT) to gain insights into quantum walks (QWs) and quantum annealing (QA) beyond the adiabatic theorem. By representing the eigenspace of the problem Hamiltonian as a hypercube graph, we…
We examine the effect of network heterogeneity on the performance of quantum search algorithms. To this end, we study quantum search on a tree for the oracle Hamiltonian formulation employed by continuous-time quantum walks. We use…
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work,…
Several models have been proposed to build evolution operators to perform quantum walks in a theoretical way, although when wanting to map the resulting evolution operators into quantum circuits to run them in quantum computers, it is often…
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
This paper investigates the performance of the emerging non-variational Quantum Walk-based Optimisation Algorithm (NV-QWOA) for solving small instances of the Quadratic Assignment Problem (QAP). NV-QWOA is benchmarked against classical…
Testing graph completeness is a critical problem in computer science and network theory. Leveraging quantum computation, we present an efficient algorithm using the Szegedy quantum walk and quantum phase estimation (QPE). Our algorithm,…
This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process…
Estimation of the coin parameter(s) is an important part of the problem of implementing more robust schemes for quantum simulation using quantum walks. We present the estimation of the quantum coin parameter used for one-dimensional…
We present a novel methodological framework for quantum spatial search, generalising the Childs & Goldstone ($\mathcal{CG}$) algorithm via alternating applications of marked-vertex phase shifts and continuous-time quantum walks. We…
In this paper we present a model exhibiting a new type of continuous-time quantum walk (as a quantum mechanical transport process) on networks, which is described by a non-Hermitian Hamiltonian possessing a real spectrum. We call it…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. Searching in this mathematical framework has interested the community since a long time. However, most results consider spatial search…
Quantum walks underlie an important class of quantum computing algorithms, and represent promising approaches in various simulations and practical applications. Here we design stroboscopically monitored quantum walks and their subsequent…
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…
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…
We show that the entanglement between the internal (spin) and external (position) degrees of freedom of a qubit in a random (dynamically disordered) one-dimensional discrete time quantum random walk (QRW) achieves its maximal possible value…
A modification of Tulsi's quantum search algorithm with intermediate measurements of the control is presented. In order to analyze the effect of measurements in quantum searches, a different choice of the angular parameter is used. The…