Randomized decision tree complexity of Deutsch–Jozsa problem and a generalization
G Xu, D Qiu, B Zhang, T Wang, Y Zhang - Quantum Information Processing, 2024 - Springer
Deutsch–Jozsa problem (DJ n) showed for the first time that quantum computation can
achieve exponential advantages over classical computers, which encouraged and laid the …
achieve exponential advantages over classical computers, which encouraged and laid the …
Partial Boolean functions with exact quantum query complexity one
G Xu, D Qiu - Entropy, 2021 - mdpi.com
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 …
function with exact quantum query complexity 1. Using the first characterization, we present …
Polynomial representation of general partial Boolean functions with a single quantum query
X Guoliang, Q Daowen - arXiv preprint arXiv:2112.12416, 2021 - arxiv.org
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with
a single quantum query, and thus achieved the best separation between classical …
a single quantum query, and thus achieved the best separation between classical …
Exact Quantum Query Algorithms Outperforming Parity--Beyond The Symmetric functions
CS Mukherjee, S Maitra - arXiv preprint arXiv:2008.06317, 2020 - arxiv.org
In Exact Quantum Query model, almost all of the Boolean functions for which non-trivial
query algorithms exist are symmetric in nature. The most well known techniques in this …
query algorithms exist are symmetric in nature. The most well known techniques in this …