Partial Boolean Functions with Exact Quantum Query Complexity One
We provide two sufficient and necessary conditions to characterize any <i>n</i>-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all <i>n</i>-bit partial Boolean functions that depend on <i>n</i> bits...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-02-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/23/2/189 |