Sciweavers

3250 search results - page 6 / 650
» Quantum behaviors and networks
Sort
View
FOCS
1998
IEEE
13 years 12 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...
STACS
2005
Springer
14 years 1 months ago
Exact Quantum Algorithms for the Leader Election Problem
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumot...
ISCA
2006
IEEE
107views Hardware» more  ISCA 2006»
14 years 1 months ago
Distributed Arithmetic on a Quantum Multicomputer
We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and t...
Rodney Van Meter, Kae Nemoto, W. J. Munro, Kohei M...
AMC
2006
104views more  AMC 2006»
13 years 7 months ago
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical ta
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
Warren D. Smith