Manjushri: A Tool for Equivalence Checking of Quantum Circuits
Xuan Du Trinh, Meghana Sistla, Nengkun Yu, Thomas Reps

TL;DR
Manjushri is a scalable, automated framework for quantum circuit equivalence checking that outperforms existing tools in speed and efficiency for circuits up to a certain depth, using local projections and symbolic representations.
Contribution
Introduces Manjushri, a novel quantum circuit equivalence checking tool using local projections and WBDDs, demonstrating superior speed and scalability over prior methods.
Findings
Manjushri is about 10x faster than ECMC for equivalent circuits up to depth 30.
Manjushri maintains high success rates up to depth 38 for large circuits.
ECMC performs better on circuits with depths beyond 38, especially for 32- and 64-qubit circuits.
Abstract
Verifying whether two quantum circuits are equivalent is a central challenge in the compilation and optimization of quantum programs. We introduce \textsc{Manjushri}, a new automated framework for scalable quantum-circuit equivalence checking. \textsc{Manjushri} uses local projections as discriminative circuit fingerprints, implemented with weighted binary decision diagrams (WBDDs), yielding a compact and efficient symbolic representation of quantum behavior. We present an extensive experimental evaluation that, for random 1D Clifford+ circuits, explores the trade-off between \textsc{Manjushri} and \textsc{ECMC}, a tool for equivalence checking based on a much different approach. \textsc{Manjushri} is much faster up to depth 30 (with the crossover point varying from 39--49, depending on the number of qubits and whether the input circuits are equivalent or inequivalent): when inputs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs · Formal Methods in Verification
