Classical lower bounds from quantum upper bounds
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 339.0-349, 2018.
EI
Abstract:
We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the combinatorial group testing problem. We show that for any function f, the approximate degree of comput...More
Code:
Data:
Get fulltext within 24h
Other Links
Upload PDF
1.Your uploaded documents will be check within 24h, and coins will be credited to your account.
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.
?
￥
Upload a single paper
for 5 coins
Wechat's Red Packet
?
￥
Upload 50 articles
for 280 coins
Wechat's Red Packet
?
￥
Upload 200 articles
for 1200 coins
Wechat's Red Packet
?
￥
Upload 500 articles
for 3000 coins
Wechat's Red Packet
?
￥
Upload 1000 articles
for 7000 coins
Wechat's Red Packet
Tags
Comments