Related papers: Evolution of Quantum Resources in Quantum-walk-bas…
Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence…
Decoherence phenomenon has been widely studied in different types of quantum walks. In this work we show how to model decoherence inspired by percolation on staggered quantum walks. Two models of unitary noise are described: breaking…
In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional search algorithm lacks the capacity to simultaneously amplify…
In this article we investigate the effects of shifting position decoherence, arisen from the tunneling effect in the experimental realization of the quantum walk, on the one-dimensional discreet time quantum walk. We show that in the regime…
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of…
Classical random walk formalism shows a significant role across a wide range of applications. As its quantum counterpart, the quantum walk is proposed as an important theoretical model for quantum computing. By exploiting the quantum…
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)…
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…
We study the discrete-time quantum walk-based search for a marked vertex on a graph. By considering various structures in which not all vertices are equivalent, we investigate the relationship between the successful search probability and…
The question of which resources drive the advantages in quantum algorithms has long been a fundamental challenge. While entanglement and coherence are critical to many quantum algorithms, our results indicate that they do not fully explain…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…
Two primary facets of quantum technological advancement that hold great promise are quantum communication and quantum computation. For quantum communication, the canonical resource is entanglement. For quantum gate implementation, the…
We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N^{2/3}) query quantum algorithm.…
For harnessing the full potential of quantum phenomena, light-matter interfaces and complexly connected quantum networks are required, relying on the joint quantum operation of different physical platforms. In this work, we analyze the…
Quantum search algorithms are crucial for exploring large solution spaces, but their robustness to environmental perturbations, such as noise or disorder, remains a critical challenge. We examine the impact of biased disorder potentials…
We investigate the global chirality distribution of the quantum walk on the line when decoherence is introduced either through simultaneous measurements of the chirality and particle position, or as a result of broken links. The first…
Quantum resource theories allow us to quantify a useful quantum phenomenon, to develop new protocols for its detection and determine the exact processes that maximize its use for practical tasks. These theories aim at transforming physical…
An ideal quantum walk transitions from one vertex to another with perfect fidelity, but in physical systems, the particle may be hindered by potential energy barriers. Then the particle has some amplitude of tunneling through the barriers,…