Quantum recursive programming has been recently introduced for describing sophisticated and complicated quantum algorithms in a compact and elegant way. However, implementation of quantum recursion involves intricate interplay between quantum control flows and recursive procedure calls. In this paper, we aim at resolving this fundamental challenge and develop a series of techniques to efficiently implement quantum recursive programs. Our main contributions include:

• We propose a notion of \textit{quantum register machine}, the first purely quantum architecture (including an instruction set) that supports quantum control flows and recursive procedure calls at the same time.

• Based on quantum register machine, we describe the first \textit{comprehensive implementation process} of quantum recursive programs, including the compilation, the partial evaluation of quantum control flows, and the execution on the quantum register machine.

• As a bonus, our efficient implementation of quantum recursive programs also offers \textit{automatic parallelisation} of quantum algorithms. For implementing certain quantum algorithmic subroutine, like the widely used quantum multiplexor, we can even obtain exponential parallel speed-up (over the straightforward implementation) from this automatic parallelisation. This demonstrates that quantum recursive programming can be win-win for both modularity of programs and efficiency of their implementation.