Sciweavers

1391 search results - page 10 / 279
» Complexity Limitations on Quantum Computation
Sort
View
CPHYSICS
2007
71views more  CPHYSICS 2007»
13 years 7 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
ISNN
2009
Springer
14 years 2 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu
PPL
2010
118views more  PPL 2010»
13 years 6 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 4 days 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
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
14 years 1 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