A Grover-Meets-Simon Approach to Match Vector Boolean Functions

The Boolean matching problem via NP-equivalence requires determining whether two Boolean functions are equivalent or not up to a permutation and negation of the input binary variables. Its solution is a fundamental step in the electronic design automation (EDA) tool chains commonly used for digital...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on quantum engineering Ročník 6; s. 1 - 14
Hlavní autori:	Venere, Marco, Barenghi, Alessandro, Pelosi, Gerardo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Benchmark testing Boolean Boolean functions Circuit design Codes Digital circuits Digital electronics Electronic design automation Electronic design automation (EDA) Equivalence Integrated circuit interconnections Libraries Logic gates Matching negation–permutation–negation equivalence (NPN-equivalence) Permutations Polynomials Quantum algorithm quantum-aided Boolean matching Time complexity Vectors
ISSN:	2689-1808, 2689-1808
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!