A Brief Note on a Recent Claim About NP-Hard Problems and BQP
Computational Complexity
2024-06-14 v1
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.
Cite
@article{arxiv.2406.08495,
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}
}
Comments
Comment on arXiv:2311.05624