Sciweavers

5215 search results - page 5 / 1043
» Quantum clustering algorithms
Sort
View
ECCC
2010
103views more  ECCC 2010»
13 years 9 months ago
Time-Space Efficient Simulations of Quantum Computations
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
Dieter van Melkebeek, Thomas Watson
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 9 months ago
Extending scientific computing system with structural quantum programming capabilities
We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming langua...
P. Gawron, Jerzy Klamka, J. A. Miszczak, Ryszard W...
ISCI
2000
92views more  ISCI 2000»
13 years 9 months ago
Quantum associative memory
This paper combines quantum computation with classical neural network theory to produce a quantum computational learning algorithm. Quantum computation uses microscopic quantum lev...
Dan Ventura, Tony R. Martinez
ISMVL
2002
IEEE
84views Hardware» more  ISMVL 2002»
14 years 2 months ago
The Role of Super-Fast Transforms in Speeding Up Quantum Computations
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
Zeljko Zilic, Katarzyna Radecka
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 3 months ago
Evolution of a human-competitive quantum fourier transform algorithm using genetic programming
In this paper, we show how genetic programming (GP) can be used to evolve system-size-independent quantum algorithms, and present a human-competitive Quantum Fourier Transform (QF...
Paul Massey, John A. Clark, Susan Stepney