Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

Given a function <i>f</i> as an oracle, the collision problem is to find two distinct indexes <i>i</i> and <i>j</i> such that <i… Expand

Is this relevant?

2004

2004

Quantum search is a technique for searching N possibilities for a desired target in O(√N)steps. It has been applied in the design… Expand

Is this relevant?

2004

2004

We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element… Expand

Is this relevant?

2004

2004

L'objet de ce travail est de développer une application de la la méthode LATIN [LAD 99] pour l'étude paramétrique d'assemblages… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Abstract. We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered… Expand

Is this relevant?

2000

2000

We present several applications of quantum amplitude amplification for deciding whether all elements in the image of a given… Expand

Is this relevant?

1984

1984

Combinatorial techniques for extending lower bounds results for decision trees to general types of queries are presented. We… Expand

Is this relevant?