Sciweavers

8 search results - page 1 / 2
» Exponential algorithmic speedup by a quantum walk
Sort
View
STOC
2003
ACM
88views Algorithms» more  STOC 2003»
14 years 5 months ago
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto, Ed...
IAT
2008
IEEE
13 years 11 months ago
Quantum Service Selection
Quantum service selection facilitates matchmaking of Web services and greatly benefits from quantum memory exponential in the number of its qubits as well as from computational s...
Matthias Klusch, René Schubotz
ANSS
2005
IEEE
13 years 10 months ago
The Bubble Bit Technique as Improvement of HDL-Based Quantum Circuits Simulation
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...
Mihai Udrescu, Lucian Prodan, Mircea Vladutiu
FOCS
1998
IEEE
13 years 9 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...
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
14 years 1 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes