Parameterized Quantum Query Algorithms for Graph Problems
Quantum Physics
2024-08-08 v1 Data Structures and Algorithms
Abstract
In this paper, we consider the parameterized quantum query complexity for graph problems. We design parameterized quantum query algorithms for -vertex cover and -matching problems, and present lower bounds on the parameterized quantum query complexity. Then, we show that our quantum query algorithms are optimal up to a constant factor when the parameters are small.
Cite
@article{arxiv.2408.03864,
title = {Parameterized Quantum Query Algorithms for Graph Problems},
author = {Tatsuya Terao and Ryuhei Mori},
journal= {arXiv preprint arXiv:2408.03864},
year = {2024}
}
Comments
32 pages, 4 figures, abstract shortened to meet arXiv requirement; to appear in ESA'24