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

Full description

Saved in:

Bibliographic Details
Published in:	Quantum information processing Vol. 20; no. 6
Main Authors:	Mukherjee, Chandra Sekhar, Maitra, Subhamoy
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2021 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!