Circuit Minimization with QBF-Based Exact Synthesis
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Abstract
This paper presents a rewriting method for Boolean circuits that minimizes small subcircuits with exact synthesis. Individual synthesis tasks are encoded as Quantified Boolean Formulas (QBFs) that capture the full flexibility for implementing multi-output subcircuits. This is in contrast to SAT-based resynthesis, where "don't cares" are computed for an individual gate, and replacements are confined to the circuitry used exclusively by that gate. An implementation of our method achieved substantial size reductions compared to state-of-the-art methods across a wide range of benchmark circuits.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- SAT-based Decision Tree Learning for Large Data SetsAndré Schidler, Stefan SzeiderAAAI 2021 · 72 citations
- SAT-Based Tree Decomposition with Iterative Cascading Policy SelectionHai Xia, Stefan SzeiderAAAI 2024 · 1 citation
- Cirbo: A New Tool for Boolean Circuit Analysis and SynthesisDaniil Averkov, Tatiana Belova, Gregory Emdin, Mikhail Goncharov et al.AAAI 2025
Builds on2
Related papers
- Optimizing Quantum Circuits, Fast and SlowAmanda Xu, Abtin Molavi, Swamit Tannu, Aws AlbarghouthiASPLOS 2025 · 8 citations
- Synthesis of Compact and Expressive Quantum-Circuit OptimizationsWei Qiang, Ronghui GuOOPSLA 2026
- Search space characterization for approximate logic synthesisLinus Witschen, Tobias Wiersema, Lucas Reuter, Marco PlatznerDAC 2022 · 3 citations
- Interpolation-Based Semantic Gate Extraction and Its Applications to QBF PreprocessingFriedrich SlivovskyCAV 2020 · 10 citations
- Equality Saturation for Quantum Circuit OptimizationGanxiang Yang, Paige Raun, Runzhou Tao, Ronghui GuPLDI 2026
