Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3643
Articles: 2'487'895
Articles rated: 2609

28 March 2024
 
  » arxiv » 1310.4127

 Article overview


Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs
François Le Gall ; Harumichi Nishimura ; Seiichiro Tani ;
Date 15 Oct 2013
AbstractWe develop a framework based on nested quantum walks for finding a constant-sized sub-hypergraph in a 3-uniform hypergraph. As an application of this framework, we obtain a quantum algorithm that finds a 4-clique in a 3-uniform hypergraph using $ ilde O(n^{241/128})=O(n^{1.883})$ queries, while na"{i}ve Grover search over the $inom{n}{4}$ combinations of vertices only gives $O(n^{2})$.
Source arXiv, 1310.4127
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

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  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica