Sciweavers

1352 search results - page 240 / 271
» Fault-Tolerant Quantum Computation
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
14 years 11 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 8 days ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
DATE
2004
IEEE
131views Hardware» more  DATE 2004»
15 years 2 months ago
Testing of Quantum Dot Cellular Automata Based Designs
There has been considerable research on quantum dots cellular automata as a new computing scheme in the nano-scale regimes. The basic logic element of this technology is a majorit...
Mehdi Baradaran Tahoori, Fabrizio Lombardi
FOCS
2003
IEEE
15 years 4 months ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis
CIKM
2007
Springer
15 years 5 months ago
Optimal proactive caching in peer-to-peer network: analysis and application
As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-toPeer (P2P) technology is used as the underlying network to b...
Weixiong Rao, Lei Chen 0002, Ada Wai-Chee Fu, Ying...