Sciweavers

342 search results - page 21 / 69
» Quantum Algorithms
Sort
View
153
Voted
COCOON
2006
Springer
15 years 9 months ago
The Complexity of Black-Box Ring Problems
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
147
Voted
COMPUTING
2004
87views more  COMPUTING 2004»
15 years 5 months ago
The Generalized Quantum Database Search Algorithm
In this paper we present a generalized description of the Grover operator, employed in a quantum database search algorithm. We will discuss the relation between the original and ge...
Sándor Imre, Ferenc Balázs
140
Voted
AAECC
2006
Springer
117views Algorithms» more  AAECC 2006»
15 years 12 months ago
Quantum Period Reconstruction of Binary Sequences
Abstract. We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algor...
Florina Piroi, Arne Winterhof
FOCS
1998
IEEE
15 years 10 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
168
Voted
CORR
2011
Springer
193views Education» more  CORR 2011»
15 years 26 days ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker