We present an algorithm turning any term of a linear quantum λ-calculus into a quantum circuit. The essential ingredient behind the proposed algorithm is Girard's geometry of interaction, which, differently from its well-known uses from the literature, is here leveraged to perform as much of the classical computation as possible, while producing a circuit that, when executed, performs all the quantum operations in the underlying λ-term. Noticeably, we identify a class of terms which can be compiled without an exponential blowup, which is encountered when using plain operational semantics.