508 search results - page 8 / 102 » Poly-locality in quantum computing |
FOCS
2003
IEEE
14 years 23 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 8 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 22 days 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 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...