Quokka#: Quantum Computing with #SAT
Jingyi Mei, Dekel Zak, Muhammad Osama, Tim Coopmans, Alfons Laarman

TL;DR
Quokka# is an open-source Python library that simplifies quantum circuit analysis by leveraging weighted model counting (#SAT), supporting various gates, encodings, and approximate equivalence checking for efficient synthesis.
Contribution
It introduces Quokka#, a versatile tool for quantum circuit analysis with novel approximate equivalence checking and depth-optimal synthesis capabilities.
Findings
Supports universal quantum circuits and diverse gates.
Enables translation between arbitrary gate sets.
Provides depth-optimal synthesis for real-world quantum computing.
Abstract
We present Quokka#, a versatile, open-source Python library for quantum circuit analysis. Quokka# reduces various simulation, verification, and synthesis tasks to weighted model counting (#SAT). It supports universal quantum circuits and a wide variety of gates. Quokka# provides multiple encodings based on different algebraic bases and equivalence-checking methods, enabling key performance trade-offs. Moreover, the new version of Quokka# adds approximate equivalence checking, which is crucial in its synthesis algorithms, since it enables translation between arbitrary gate sets. Its synthesis engine is depth-optimal, making it well-suited to real-world quantum computing. This paper demonstrates the design, extensibility, and use of Quokka#.
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.
