700 search results - page 9 / 140 » An Introduction to Quantum Computing |
QCQC
1998
Springer
13 years 12 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
AIEDAM
2008
13 years 7 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
FOCS
2003
IEEE
14 years 28 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
NC
2007
13 years 7 months ago
2007
In quantum computational logic meanings of sentences are identified with quantum information quantities: systems of qubits or, more generally, mixtures of systems of qubits. We co...
AIPS
2006
13 years 9 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...