Parity decision tree in classical–quantum separations for certain classes of Boolean functions

In this paper, we study the separation between the deterministic (classical) query complexity ( D ) and the exact quantum query complexity ( Q E ) of several Boolean function classes using the parity decision tree method. We first define the query friendly (QF) functions on n variables as the ones w...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Quantum information processing Ročník 20; číslo 6
Hlavní autori:	Mukherjee, Chandra Sekhar, Maitra, Subhamoy
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.06.2021 Springer Nature B.V
Predmet:	Boolean Boolean algebra Boolean functions Codes Complexity Data Structures and Information Theory Decision analysis Decision trees Mathematical analysis Mathematical Physics Parity Physics Physics and Astronomy Quantum Computing Quantum Information Technology Quantum Physics Queries Separation Spintronics Classical–quantum separation Boolean functions Parity decision tree Query complexity Bent functions Query friendly functions
ISSN:	1570-0755, 1573-1332
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!