Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions

Quantum algorithms for the analysis of Boolean functions have received a lot of attention over the last few years. The algebraic normal form (ANF) of a linear Boolean function can be recovered by using the Bernstein–Vazirani (BV) algorithm. No research has been carried out on quantum algorithms for...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Quantum information processing Jg. 19; H. 8
Hauptverfasser:	Hao, Xuexuan, Zhang, Fengrong, Xia, Shixiong, Zhou, Yong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2020 Springer Nature B.V
Schlagworte:	Algorithms Boolean Boolean algebra Boolean functions Canonical forms Codes Data Structures and Information Theory Independent variables Machine learning Mathematical analysis Mathematical Physics Physics Physics and Astronomy Quadratic equations Quantum Computing Quantum Information Technology Quantum Physics Spintronics Boolean function Quantum computation Bernstein–Vazirani algorithm Quantum cryptanalysis
ISSN:	1570-0755, 1573-1332
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!