30 search results - page 4 / 6 » The Church-Turing-Deutsch Principle in Quantum Computation |
QCQC
1998
Springer
13 years 10 months ago
1998
Springer
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 ...
ISNN
2009
Springer
14 years 9 days ago
2009
Springer
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...
ICPR
2008
IEEE
14 years 7 months ago
2008
IEEE
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
CDES
2006
13 years 7 months ago
2006
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...