Sciweavers

934 search results - page 4 / 187
» Quantum Algorithmic Entropy
Sort
View
AIEDAM
2008
127views more  AIEDAM 2008»
13 years 7 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
ISCAS
2003
IEEE
126views Hardware» more  ISCAS 2003»
14 years 23 days ago
High-speed processor for quantum-computing emulation and its applications
A high-speed and large-scale processor dedicated to quantum computing is proposed, which has the minimum operation function needed for execution of a quantum algorithm. In this pr...
Minoru Fujishima, Kaoru Saito, M. Onouchi, Koichir...
EH
2002
IEEE
154views Hardware» more  EH 2002»
14 years 13 days ago
Evolving Quantum Circuits Using Genetic Algorithm
: In this paper we focus on a general approach of using genetic algorithm (GA) to evolve Quantum circuits (QC). We propose a generic GA to evolve arbitrary quantum circuit specifie...
Martin Lukac, Marek A. Perkowski
JUCS
2006
137views more  JUCS 2006»
13 years 7 months ago
Progress in Quantum Computational Cryptography
: Shor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. ...
Akinori Kawachi, Takeshi Koshiba
TOC
2010
147views Management» more  TOC 2010»
13 years 2 months ago
Quantum Expanders: Motivation and Construction
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma