Upperbounds on the probability of finding marked connected components using quantum walks
From MaRDI portal
Publication:6315037
DOI10.1007/S11128-020-02939-4zbMath1509.81265arXiv1903.01482MaRDI QIDQ6315037
Nikolajs Nahimovs, Konstantin Balakirev, Adam Glos, Kamil Khadiev
Publication date: 4 March 2019
Quantum computation (81P68) Random walks on graphs (05C81) Quantum state spaces, operational and probabilistic concepts (81P16)
This page was built for publication: Upperbounds on the probability of finding marked connected components using quantum walks