Parameterized Quantum Query Algorithms for Graph Problems
<|reference_start|>Parameterized Quantum Query Algorithms for Graph Problems: In this paper, we consider the parameterized quantum query complexity for graph problems. We design parameterized quantum query algorithms for $k$-vertex cover and $k$-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.<|reference_end|>
@article{terao2024parameterized,
    title={Parameterized Quantum Query Algorithms for Graph Problems},
    author={Tatsuya Terao, Ryuhei Mori},
    journal={arXiv preprint arXiv:2408.03864},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.03864},
    primaryClass={quant-ph cs.DS}
}