Sciweavers

20831 search results - page 88 / 4167
» Quantum Computation and Information
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 8 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»
13 years 10 months 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»
14 years 16 days 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
ISMVL
2008
IEEE
160views Hardware» more  ISMVL 2008»
14 years 3 months ago
Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...
Daniel Große, Robert Wille, Gerhard W. Dueck...
UC
2005
Springer
14 years 2 months ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover