Sciweavers

5215 search results - page 29 / 1043
» Quantum clustering algorithms
Sort
View
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
15 years 2 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
MCU
2004
95views Hardware» more  MCU 2004»
14 years 11 months ago
Algorithmic Randomness, Quantum Physics, and Incompleteness
Abstract. Is randomness in quantum mechanics "algorithmically random"? Is there any relation between Heisenberg's uncertainty relation and G
Cristian Calude
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 10 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi
TEC
2002
101views more  TEC 2002»
14 years 9 months ago
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
Kuk-Hyun Han, Jong-Hwan Kim
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
15 years 10 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer