2 research outputs found
Quantum Query Complexity of Subgraph Containment with Constant-sized Certificates
We study the quantum query complexity of constant-sized subgraph containment.
Such problems include determining whether an -vertex graph contains a
triangle, clique or star of some size. For a general subgraph with
vertices, we show that containment can be solved with quantum query
complexity , with a strictly positive
function of . This is better than \tilde{O}\s{n^{2-2/k}} by Magniez et
al. These results are obtained in the learning graph model of Belovs.Comment: 14 pages, 1 figure, published under title:"Quantum Query Complexity
of Constant-sized Subgraph Containment