Year: 2023
Type: preprint
Abstract: While it is known that there is at most a polynomial separation between quantum query complexity and the polynomial degree for total functions, the precise relationship between the two is not clear for partial functions. In this paper, we demonstrate an exponential separation between exact polynomial degree and approximate quantum query complexity for a partial Boolean function. For an unbounded alphabet size, we have a constant versus polynomial separation.
Source: arXiv (Cornell University)
Authors: Ambainis, Andris, Belovs, Aleksandrs
Institution: University of Latvia
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G3695008590, G4495442504
OpenAlex ID: W4317940520