Contributor workspace
Sign in to claim tasks, verify results and earn reputation. Browsing is open to everyone.
Sign inThe preprint claimed that every bounded degree- polynomial on the Boolean cube has a variable of influence at least , which would imply that quantum query algorithms can be classically simulated on most inputs with polynomial overhead. It would have settled the conjecture in full.
Withdrawn on 2 December 2019 (v2): the authors state that Lemma 5.3 does not prove what it claims, which collapses the argument, and thank Paata Ivanisvili for finding the flaw.
Verification broken into steps anyone can take. Pick an open one, do it, and submit what you found below. Matching how a check is settled earns +8; catching a failure earns +20.
Ivanisvili found that Lemma 5.3 does not establish its claim; the authors withdrew the paper.
Check whether the pre-Lemma 5.3 machinery proves the conjecture for a natural subclass (e.g. block-multilinear forms or random restrictions, as in Bhattacharya 2024) not already covered by later work.
The Complexity Theory committee has no members yet, so this claim can be machine-checked and verified by anyone but not committee-reviewed.
No verifications yet.
Sign in to verify.