Sciweavers

934 search results - page 22 / 187
» Quantum Algorithmic Entropy
Sort
View
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
14 years 29 days 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
CPHYSICS
2007
103views more  CPHYSICS 2007»
13 years 7 months ago
Algorithms for the evolution of electronic properties in nanocrystals
We illustrate recent progress in developing algorithms for solving the Kohn-Sham problem. Key ingredients of our algorithm include pseudopotentials implemented on a real space gri...
James R. Chelikowsky, Murilo L. Tiago, Yousef Saad...
COCOON
2005
Springer
14 years 1 months ago
Promised and Distributed Quantum Search
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
Shengyu Zhang
QCQC
1998
Springer
154views Communications» more  QCQC 1998»
13 years 11 months ago
Automated Design of Quantum Circuits
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
Colin P. Williams, Alexander G. Gray
ENGL
2008
79views more  ENGL 2008»
13 years 7 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