Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1907.12277

Comment on Nahimovs et al. `On the probability of finding marked connected components using quantum walks'

Adam Glos, Nikolay Nahimovs

Published Jul 29, 2019• 1 citation
arXivHTMLPDF

Abstract

In this comment paper we present two misconceptions found in paper of Nahimovs et al. \emph{On the probability of finding marked connected components using quantum walks}. First, we show that the Theorem 2 (sufficient and necessary condition for a state to be stationary) is incomplete -- it works only if unmarked vertices form a single connected component. Second, we correct derivation of \emph{a} coefficient in the Theorem 3 (lower bound on the probability) and show how to upper bound value of \emph{a}.

DOI
10.48550/arxiv.1907.12277

Related papers

On the Probability of Finding Marked Connected Components Using Quantum Walks

Kamil Ravilevich Khadiev, Nikolajs Nahimovs, Raqueline A. M. Santos

Finding a marked vertex in a graph can be a complicated task when using quantum walks. Recent results show that for two or more adjacent marked vertices search by quantum walk with Grover’s coin may have no speed-up over classical exhaustive search. In this paper, we analyze the probability of finding a marked vertex for a set of connected components of marked vertices. We prove two upper bounds on the probability of finding a marked vertex and sketch further research directions.

arXiv:1710.04046•Lobachevskii Journal of Mathematics•Sep 1, 2018•5 citations

Stationary states in quantum walk search

Krišjānis Prūsis, Jevgēnijs Vihrovs, Thomas G. Wong

When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, additional marked vertices can make the search harder by causing the system to approximately begin in a stationary state, so the system fails to evolve. In this paper, we completely characterize the stationary states, or 1-eigenvectors, of the quantum walk search operator for general graphs and configurations of marked vertices by decomposing their amplitudes into uniform and flip states. This infinitely expands the number of known stationary states and gives an optimization procedure to find the stationary state closest to the initial uniform state of the walk. We further prove theorems on the existence of stationary states, with them conditionally existing if the marked vertices form a bipartite connected component and always existing if nonbipartite. These results utilize the standard oracle in Grover's algorithm, but we show that a different type of oracle prevents stationary states from interfering with the search algorithm.

arXiv:1608.00136•Physical Review A•Sep 29, 2016•13 citations

Upperbounds on the probability of finding marked connected components using quantum walks

Adam Glos, Nikolajs Nahimovs, Konstantin Balakirev +1 more

arXiv:1903.01482•Quantum Information Processing•Jan 1, 2021•11 citations

Fixed-point Quantum Walk Search.

Lvzhou Li, Yongzhen Xu, Zhang Delong

n this paper, we consider the problem of searching a marked vertex in a graph based on quantum walks. A very large body of research exists on this issue, from both theoretical and experimental studies, yet the existing quantum walk-based search algorithms require knowing exactly how many marked vertices there are before starting the search process. In addition, even if the precise knowledge of the number of marked vertices is known, the success probability of these algorithms could shrink dramatically when the number of search steps is greater than the right one. For avoiding these defects, in this paper we present a new quantum walk-based search algorithm which need not know any prior information about the marked vertices, but still keeps a quadratic speedup over classical ones and ensures that the error is bounded by a tunable parameter $\epsilon$. More specifically, for an $N$-vertex complete bipartite graph with marked vertices but without knowing the number of marked vertices, if the number of search steps $h$ satisfies $h \geq \ln(\frac{2}{\sqrt{\epsilon}})\sqrt{N}$, then the algorithm will output a marked vertex with probability at least $ 1-\epsilon$ for any given $\epsilon\in (0,1]$. This feature leads to quantum search algorithms with stronger robustness and a wider scope of application.

•Nov 17, 2021•0 citations

Quantum walks on directed graphs

Ashley Montanaro

We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices $(v_i, v_j)$, if $v_i$ is connected to $v_j$ then there is a path from $v_j$ to $v_i$. We show that reversibility is a necessary and sufficient condition for a directed graph to allow the notion of a discrete-time quantum walk, and discuss some implications of this condition. We present a method for defining a "partially quantum'' walk on directed graphs that are not reversible.

arXiv:quant-ph/0504116•Quantum Information and Computation•Jan 1, 2007•41 citations

D6.18 QPSA Quantum Walks and Markov

Hibti, Mohamed, Ahmed Zaiou

In this work, we present a quantum walks based approach for Probabilistic Safety Assessment problems in the dynamic Markovian framework. After presenting well known quantum walk algorithms for detecting or finding marked elements in a graph or for finding paths in specific graphs, we propose two algorithms to address the more general problem of finding paths from some point to marked elements. The first algorithm is based on move and store strategy to built failure sequences from an initial state to the marked states. It uses a full register assembling qubits representing components of the system under study and other control and ancilla qubits (between n and 2n) to identify all the sequences. The second algorithm is based on a hybrid approach to consider di˙erent cascading circuits for solving relatively large instances. We present some tests on a Qiskit simulation library that were performed to compare our algorithms against classical random walks. These tests showed that classical approach has advances in the first iteration but the hybrid approach scales better in the sense that it identifies a large number of paths and converges towards all the possible paths to these marked vertices.

•Jun 9, 2023•0 citations
In this comment paper we present two misconceptions found in paper of Nahimovs et al. \emph{On the probability of finding marked connected components using quantum walks}. First, we show that the Theorem 2 (sufficient and necessary condition for a state to be stationary) is incomplete -- it works only if unmarked vertices form a single connected component. Second, we correct derivation of \emph{a} coefficient in the Theorem 3 (lower bound on the probability) and show how to upper bound value of \emph{a}.
When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, additional marked vertices can make the search harder by causing the system to approximately begin in a stationary state, so the system fails to evolve. In this paper, we completely characterize the stationary states, or 1-eigenvectors, of the quantum walk search operator for general graphs and configurations of marked vertices by decomposing their amplitudes into uniform and flip states. This infinitely expands the number of known stationary states and gives an optimization procedure to find the stationary state closest to the initial uniform state of the walk. We further prove theorems on the existence of stationary states, with them conditionally existing if the marked vertices form a bipartite connected component and always existing if nonbipartite. These results utilize the standard oracle in Grover's algorithm, but we show that a different type of oracle prevents stationary states from interfering with the search algorithm.
n this paper, we consider the problem of searching a marked vertex in a graph based on quantum walks. A very large body of research exists on this issue, from both theoretical and experimental studies, yet the existing quantum walk-based search algorithms require knowing exactly how many marked vertices there are before starting the search process. In addition, even if the precise knowledge of the number of marked vertices is known, the success probability of these algorithms could shrink dramatically when the number of search steps is greater than the right one. For avoiding these defects, in this paper we present a new quantum walk-based search algorithm which need not know any prior information about the marked vertices, but still keeps a quadratic speedup over classical ones and ensures that the error is bounded by a tunable parameter ϵ\epsilonϵ. More specifically, for an NNN-vertex complete bipartite graph with marked vertices but without knowing the number of marked vertices, if the number of search steps hhh satisfies h≥ln⁡(2ϵ)Nh \geq \ln(\frac{2}{\sqrt{\epsilon}})\sqrt{N}h≥ln(ϵ​2​)N​, then the algorithm will output a marked vertex with probability at least $ 1-\epsilon$ for any given ϵ∈(0,1]\epsilon\in (0,1]ϵ∈(0,1]. This feature leads to quantum search algorithms with stronger robustness and a wider scope of application.
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (vi,vj)(v_i, v_j)(vi​,vj​), if viv_ivi​ is connected to vjv_jvj​ then there is a path from vjv_jvj​ to viv_ivi​. We show that reversibility is a necessary and sufficient condition for a directed graph to allow the notion of a discrete-time quantum walk, and discuss some implications of this condition. We present a method for defining a "partially quantum'' walk on directed graphs that are not reversible.
In this work, we present a quantum walks based approach for Probabilistic Safety Assessment problems in the dynamic Markovian framework. After presenting well known quantum walk algorithms for detecting or finding marked elements in a graph or for finding paths in specific graphs, we propose two algorithms to address the more general problem of finding paths from some point to marked elements. The first algorithm is based on move and store strategy to built failure sequences from an initial state to the marked states. It uses a full register assembling qubits representing components of the system under study and other control and ancilla qubits (between n and 2n) to identify all the sequences. The second algorithm is based on a hybrid approach to consider di˙erent cascading circuits for solving relatively large instances. We present some tests on a Qiskit simulation library that were performed to compare our algorithms against classical random walks. These tests showed that classical approach has advances in the first iteration but the hybrid approach scales better in the sense that it identifies a large number of paths and converges towards all the possible paths to these marked vertices.