A Brief Note on a Recent Claim About NP-Hard Problems and BQP
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916284831105024 |
|---|---|
| author | Chavrimootoo, Michael C. |
| author_facet | Chavrimootoo, Michael C. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_08495 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Brief Note on a Recent Claim About NP-Hard Problems and BQP Chavrimootoo, Michael C. Computational Complexity 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. |
| title | A Brief Note on a Recent Claim About NP-Hard Problems and BQP |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2406.08495 |