Sciweavers

508 search results - page 23 / 102
» Quantum Computers
Sort
View
ENGL
2008
79views more  ENGL 2008»
13 years 11 months ago
Cost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean Circuits
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
Mozammel H. A. Khan
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 11 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 3 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
BIOSYSTEMS
2007
95views more  BIOSYSTEMS 2007»
13 years 11 months ago
Physical limits of computation and emergence of life
The computational process is based on the activity linking mathematical equations to a materialized physical world. It consumes energy which lower limit is defined by the set of ...
Abir U. Igamberdiev
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
14 years 4 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf