Quantum Circuit Compilation with #SAT
summary
Quokka# is an open-source Python library that encodes quantum states and gates into weighted CNF and reduces quantum simulation, verification, equivalence checking, and synthesis to weighted model counting (and synthesis to a weighted max counting variant). It supports universal circuits with nearly any gate set, computes Jamiołkowski fidelity for exact and approximate checks, and yields depth‑optimal circuits by searching gate‑layer choices. Encoding size is linear in gates and layers, linear in qubits for simulation/verification/equivalence and polynomial in qubits for synthesis, and code is on GitHub.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:49Tool coar#SAT and apps
- 3:36Weighted model counting
- 6:06Quantum states in CNF
- 8:20Quantum gates and circuits
- 10:36Encoding for simulations
- 12:02Triple style verification
- 13:06Circuit equivalence checking
- 14:14Depth-optimal synthesis
- 15:16Tool summary
- 16:21Q&A simulation
- 17:30Q&A verification
- 18:59Q&A symbolic execution
related talks
01h 01mEmpowering the Quantum revolution with Q#
59mDiving Into Q#
01h 20mVerifiable Quantum Supremacy: What I Hope Will Be Done
01h 03mMicrosoft Q# and Azure Quantum
41mQuantum Computing deep dive
57mA Simple Quantum Sketch With Applications to Graph Algorithms
59mKeynote Panel AI in Quantum Computing
26mA sneak peek into the future with quantum computing