A

Quokka#: Quantum Computing with #SAT

Lecture notes in computer science, pp. 387–406

Abstract

Abstract We present , a versatile, open-source Python library for quantum circuit analysis. reduces various simulation, verification, and synthesis tasks to weighted model counting (#SAT). It supports universal quantum circuits and a wide variety of gates. provides multiple encodings based on different algebraic bases and equivalence-checking methods, enabling key performance trade-offs. Moreover, the new version of 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 .

Authors 5

  1. Jingyi Mei corresponding Aachen

    Leiden University

    Affiliation as printed

    Leiden University, Leiden, The Netherlands

  2. Dekel Zak Aachen

    Leiden University · Delft University of Technology

    Affiliation as printed

    Delft University of Technology, Delft, The Netherlands

    Leiden University, Leiden, The Netherlands

  3. Leiden University

    Affiliation as printed

    Leiden University, Leiden, The Netherlands

  4. Tim Coopmans Aachen

    Leiden University · Delft University of Technology

    Affiliation as printed

    Delft University of Technology, Delft, The Netherlands

    Leiden University, Leiden, The Netherlands

  5. Leiden University

    Affiliation as printed

    Leiden University, Leiden, The Netherlands

Cited by 0 stored of 0

No patents citing this paper on Lens.org (checked 2026-10-11).

References 97