Demo Data from EDBT 2026 / reviewers in the wild / expert
Dekel Zak
dblp:413/3723
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0001-0315-1539ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 50% Automated reasoning and model checking · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking
model counting |
1.0 | 1 | 2026 | Quokka#: Quantum Computing with #SAT · CAV (3) 2026 |
Quantum computing and quantum information › quantum circuit
quantum circuit analysis |
1.0 | 1 | 2026 | Quokka#: Quantum Computing with #SAT · CAV (3) 2026 |
Quantum computing and quantum information
quantum circuit synthesis |
1.0 | 1 | 2026 | Quokka#: Quantum Computing with #SAT · CAV (3) 2026 |
Automated reasoning and model checking › model counting
weighted model counting |
1.0 | 1 | 2026 | Quokka#: Quantum Computing with #SAT · CAV (3) 2026 |
Methods — techniques the papers use, named apart from their topics
equivalence checking · 1.0#SAT · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Quokka#: Quantum Computing with #SATabstractAbstract 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 . Jingyi Mei, Dekel Zak, Muhammad Osama 0003, Tim Coopmans, Alfons Laarman |
CAV (3) | 2 |
| 2025 | Reducing Quantum Circuit Synthesis to #SAT
Dekel Zak, Jingyi Mei, Jean-Marie Lagniez, Alfons Laarman |
CP | 1 |