Sciweavers

934 search results - page 4 / 187
» Quantum Algorithmic Entropy
Sort
View
87
Voted
AIEDAM
2008
127views more  AIEDAM 2008»
14 years 9 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»
15 years 2 months 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...
80
Voted
EH
2002
IEEE
154views Hardware» more  EH 2002»
15 years 2 months 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»
14 years 9 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»
14 years 4 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