A Brief Note on a Recent Claim About NP-Hard Problems and BQP

TL;DR

This paper critiques a recent claim that NP-hard problems are not in BQP, highlighting issues in the original argument and concluding it does not prove what was claimed.

Contribution

It clarifies errors in Czerwinski's paper and argues that the claim about NP-hard problems not being in BQP is unsubstantiated.

Findings

Identifies major and minor issues in Czerwinski's argument

Concludes the claim about NP-hard problems in BQP is unproven

Highlights the importance of rigorous proof in quantum complexity

Abstract

This short note outlines some of the issues in Czerwinski's paper [Cze23] claiming that NP-hard problems are not in BQP. We outline one major issue and two minor issues, and conclude that their paper does not establish what they claim it does.