Research articles

search articles

My Pages

Stat

Members: 3645
Articles: 2'500'096
Articles rated: 2609

18 April 2024

» arxiv » 1109.5135

Article overview

A learning graph based quantum query algorithm for finding constant-size subgraphs
Troy Lee ; Frederic Magniez ; Miklos Santha ;
Date:	23 Sep 2011
Abstract:	We use the learning graph framework of Belovs to show that the quantum query complexity of determining if an $n$-vertex graph contains a fixed $k$-vertex subgraph $H$ is $O(n^{2-2/k-t})$ where $t=(2k-d-3)/(k(d+1)(m+2))$ and $d$ and $m$ are such that $H$ has a vertex of degree $d$ and $m+d$ edges. The previous best algorithm of Magniez et al. had complexity $widetilde O(n^{2-2/k})$.
Source:	arXiv, 1109.5135
Services:	Forum \| Review \| PDF \| Favorites

No review found.

Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser claudebot

ScienXe.org
» my Online CV
» Free

News, job offers and information for researchers and scientists:

home

contact

sitemap