This chapter presents a scheme for verifying the results of quantum circuit compilation flows. By exploiting knowledge about the compilation flow, the proposed method can keep the intermediate representations close to the identity, thereby significantly reducing the complexity of the verification process. The resulting method is able to verify instances with more than ten thousand gates within seconds, even if optimizations are employed that are not directly accounted for.