Hypercube quantum search: exact computation of the probability of success in polynomial time
From MaRDI portal
Publication:6043535
DOI10.1007/S11128-023-03883-9arXiv2202.12973MaRDI QIDQ6043535FDOQ6043535
Authors: Hugo Pillin, G. Burel, Paul Baird, El Houssaïn Baghious, R. Gautier 
Publication date: 23 May 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Abstract: In the emerging domain of quantum algorithms, the Grover's quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success of quantum walks in the field, it is logical to study quantum search variants over several kind of walks. In this paper, we propose an in-depth study of the quantum search over a hypercube layout. First, through the analysis of elementary walk operators restricted to suitable eigenspaces, we show that the acting component of the search algorithm takes place in a small subspace of the Hilbert workspace that grows linearly with the problem size. Subsequently, we exploit this property to predict the exact evolution of the probability of success of the quantum search in polynomial time.
Full work available at URL: https://arxiv.org/abs/2202.12973
Cites Work
Cited In (1)
This page was built for publication: Hypercube quantum search: exact computation of the probability of success in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043535)
