Ansatz-based quantum computing offers solutions to many high-value problems, such as those from economics, medical science, and material science. However, to implement these algorithms reliably, it is necessary to reason about the equivalence of parameterized quantum circuits. In this extended abstract, we adapt techniques from classical parameterized verification to address these new verification problems. We provide a proof-of-concept implementation of our algorithm (available through GitHub), and a plan for future work.