  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.
