A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
[article]

2015
*
arXiv
*
pre-print

Let H be a fixed graph on n vertices. Let f_H(G) = 1 iff the input graph G on n vertices contains H as a (not necessarily induced) subgraph. Let α_H denote the cardinality of a maximum independent set of H. In this paper we show: Q(f_H) = Ω(√(α_H · n)), where Q(f_H) denotes the quantum query complexity of f_H. As a consequence we obtain a lower bounds for Q(f_H) in terms of several other parameters of H such as the average degree, minimum vertex cover, chromatic number, and the critical

arXiv:1509.06361v2
fatcat:eydgqkabuvhbhdxdxrwarfnqcu