934 search results - page 46 / 187 » Quantum Algorithmic Entropy |
151
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
166
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
167
click to vote
RTSS
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...
150
click to vote
CORR
2000
Springer
15 years 5 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
150
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...