Reachability analysis plays a central role in system design and verification. Recently, the reachability problem, embedded into a model-checking algorithm, has been considered and solved on a novel kind of real-time system --- quantum continuous-time Markov chains (QCTMCs). In this paper, we further study the repeated reachability problems in QCTMCs, denoted $\Box^I\,\Diamond^J\,\Phi$, which concerns whether the system at any absolute time in $I$ would meet the property $\Phi$ after some coming relative time in $J$. First of all, we establish the decidability by a reduction to the real root isolation of a class of real-valued functions. To speed up the procedure, we employ a sampling-based approach. The original problem is shown to be equivalent to the existence of a finite collection of solution samples. We then present a sample-driven procedure, which can effectively refine the sample space after each times of sampling, no matter whether the sample itself is successful or conflicting. The improvement on efficiency is validated by extensive randomly-generated examples. Hence the proposed method would be promising to attack the repeated reachability problems together with checking $\omega$-regular properties in a wide scope of real-time systems.