7486 search results - page 12 / 1498 » The Limits of Quantum Computers |
FOCS
2003
IEEE
14 years 24 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...
ENTCS
2007
13 years 7 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 2 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...