DeepAI AI Chat
Log In Sign Up

Exact quantum query complexity of computing Hamming weight modulo powers of two and three

by   Arjan Cornelissen, et al.
Centrum Wiskunde & Informatica

We study the problem of computing the Hamming weight of an n-bit string modulo m, for any positive integer m ≤ n whose only prime factors are 2 and 3. We show that the exact quantum query complexity of this problem is ⌈ n(1 - 1/m) ⌉. The upper bound is via an iterative query algorithm whose core components are the well-known 1-query quantum algorithm (essentially due to Deutsch) to compute the Hamming weight a 2-bit string mod 2 (i.e., the parity of the input bits), and a new 2-query quantum algorithm to compute the Hamming weight of a 3-bit string mod 3. We show a matching lower bound (in fact for arbitrary moduli m) via a variant of the polynomial method [de Wolf, SIAM J. Comput., 32(3), 2003]. This bound is for the weaker task of deciding whether or not a given n-bit input has Hamming weight 0 modulo m, and it holds even in the stronger non-deterministic quantum query model where an algorithm must have positive acceptance probability iff its input evaluates to 1. For m>2 our lower bound exceeds n/2, beating the best lower bound provable using the general polynomial method [Theorem 4.3, Beals et al., J. ACM 48(4), 2001].


page 1

page 2

page 3

page 4


Exact quantum query complexity of weight decision problems

The weight decision problem, which requires to determine the Hamming wei...

A Hamming-Like Bound for Degenerate Stabilizer Codes

The quantum Hamming bound was originally put forward as an upper bound o...

Sampling and Certifying Symmetric Functions

A circuit 𝒞 samples a distribution 𝐗 with an error ϵ if the statistical ...

Partial Boolean functions with exact quantum 1-query complexity

We provide two sufficient and necessary conditions to characterize any n...

On Query-to-Communication Lifting for Adversary Bounds

We investigate query-to-communication lifting theorems for models relate...

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching

Longest Common Substring (LCS) is an important text processing problem, ...

Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems

Recently Chen and Gao <cit.> proposed a new quantum algorithm for Boolea...