A Brief Note on a Recent Claim About NP-Hard Problems and BQP
<|reference_start|>A Brief Note on a Recent Claim About NP-Hard Problems and BQP: 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.<|reference_end|>
@article{chavrimootoo2024a,
    title={A Brief Note on a Recent Claim About NP-Hard Problems and BQP},
    author={Michael C. Chavrimootoo},
    journal={arXiv preprint arXiv:2406.08495},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.08495},
    primaryClass={cs.CC}
}