A polynomial quantum computing algorithm for solving the dualization problem

Mauro Mezzini, Fernando Cuartero Gomez, Fernando Pelayo +3

Given two prime monotone boolean functions $f:\{0,1{\}}^n\to \{0,1\}$ and $g:\{0,1{\}}^n\to \{0,1\}$ the dualization problem consists in determining if $g$ is the dual of $f$, that i…