# Quantum Lower Bound for Approximate Counting Via Laurent Polynomials

Electronic Colloquium on Computational Complexity (ECCC), Volume 25, 2019.

Cited by: 0|Views3
EI

Abstract:

We consider the following problem: estimate the size of a nonempty set $S\subseteq\left[ N\right]$, given both quantum queries to a membership oracle for $S$, and a device that generates equal superpositions $\left\vert S\right\rangle$ over $S$ elements. We show that, if $\left\vert S\right\vert$ is neither too large nor too small, t...More

Code:

Data:

Get fulltext within 24h
Bibtex

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

for 5 coins

Wechat's Red Packet
?

for 280 coins

Wechat's Red Packet
?

for 1200 coins

Wechat's Red Packet
?

for 3000 coins

Wechat's Red Packet
?