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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Entropy (Basel, Switzerland) Ročník 23; číslo 2; s. 189
Hlavní autori:	Xu, Guoliang, Qiu, Daowen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Switzerland MDPI AG 03.02.2021 MDPI
Predmet:	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
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!