ESOP-based e-CNF encoding for quantum SAT oracles yields lower qubit counts, T-gate complexity, and circuit depth than standard CNF.
Graph-based algorithms for boolean function manipulation.IEEE Transactions on Computers, C-35(8):677–691, 1986
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Performance Gains in Quantum SAT Solvers Using ESOP Encoding
ESOP-based e-CNF encoding for quantum SAT oracles yields lower qubit counts, T-gate complexity, and circuit depth than standard CNF.