20831 search results - page 16 / 4167 » Quantum Computation and Information |
FOCS
2003
IEEE
14 years 1 months 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...
AIPS
2006
13 years 10 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...
ISCA
2003
IEEE
14 years 1 months ago
2003
IEEE
As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental com...
ENTCS
2007
13 years 8 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
UC
2009
Springer
14 years 3 months ago
2009
Springer
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...