Partial Boolean Functions With Exact Quantum Query Complexity One

We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and can be computed exactly by a 1-query quantum algorit...

Full description

Saved in:

Bibliographic Details
Published in:	Entropy (Basel, Switzerland) Vol. 23; no. 2; p. 189
Main Authors:	Xu, Guoliang, Qiu, Daowen
Format:	Journal Article
Language:	English
Published:	Switzerland MDPI AG 03.02.2021 MDPI
Subjects:	Algorithms Boolean Boolean algebra Boolean functions Codes Complexity Computation Decision trees partial Boolean function quantum computation Quantum computing quantum query algorithm quantum query complexity Queries Upper bounds partial Boolean function quantum query complexity quantum computation quantum query algorithm
ISSN:	1099-4300, 1099-4300
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!