ESOP-based e-CNF encoding for quantum SAT oracles yields lower qubit counts, T-gate complexity, and circuit depth than standard CNF.
Z3: An efficient smt solver
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces clique graphs on graphs with unique ω-clique edge covers and derives spectral bounds, strongly regular classifications, and applications to existence questions.
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.
-
A Comprehensive Study of Clique Graphs and Clique Regular Graphs
Introduces clique graphs on graphs with unique ω-clique edge covers and derives spectral bounds, strongly regular classifications, and applications to existence questions.