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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on quantum engineering Jg. 6; S. 1 - 14
Hauptverfasser:	Venere, Marco, Barenghi, Alessandro, Pelosi, Gerardo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!