Sciweavers

81 search results - page 4 / 17
» Quantum Algorithms for Element Distinctness
Sort
View
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 7 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
ISAAC
2010
Springer
313views Algorithms» more  ISAAC 2010»
13 years 5 months ago
A Cache-Oblivious Implicit Dictionary with the Working Set Property
Abstract. In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting insert(e), delete(x) and predecessor(x) in O(log n) time and se...
Gerth Stølting Brodal, Casper Kejlberg-Rasm...
ICASSP
2011
IEEE
12 years 11 months ago
Uncovering elements of style
This paper relates the style of 16th century Flemish paintings by Goossen van der Weyden (GvdW) to the style of preliminary sketches or underpaintings made prior to executing the ...
Josephine Wolff, Maximiliaan Martens, Sina Jafarpo...
ENTCS
2011
77views more  ENTCS 2011»
13 years 2 months ago
Quantum Circuits: From a Network to a One-Way Model
Abstract—We present elements of quantum circuits translations from the (standard) network or circuit model to the one-way one. We present a translation scheme, give an account of...
Larisse Voufo