7 citations · 8 across the 2 of their papers we have counts for
3 papers
quant-ph2020★ 1 cited
Comment to Spatial Search by Quantum Walk is Optimal for Almost all Graphs
Ryszard Kukulski, Adam Glos
This comment is to correct the proof of optimality of quantum spatial search for Erdős-Rényi graphs presented in `Spatial Search by Quantum Walk is Optimal for Almost all Graphs' (…
quant-ph2020★ 7 cited
Space-efficient binary optimization for variational computing
Adam Glos, Aleksandra Krawiec, Zoltán Zimborás
In the era of Noisy Intermediate-Scale Quantum (NISQ) computers it is crucial to design quantum algorithms which do not require many qubits or deep circuits. Unfortunately, the mos…
quant-ph2019
Comment on Nahimovs et al. `On the probability of finding marked connected components using quantum walks'
Adam Glos, Nikolay Nahimovs
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, w…