Random access iterators and deque

I was reading some text today and it stated that since a std::deque does have a random access iterator its item retrieval rate time complexity is O(1). Although I agree with the fact that the time complexity of item retrieval is O(1) but what does having a random access iterator have to do with it ?