{"title":"A Brief Note on a Recent Claim About NP-Hard Problems and BQP","authors":"Michael C. Chavrimootoo","doi":"arxiv-2406.08495","DOIUrl":null,"url":null,"abstract":"This short note outlines some of the issues in Czerwinski's paper [Cze23]\nclaiming that NP-hard problems are not in BQP. We outline one major issue and\ntwo minor issues, and conclude that their paper does not establish what they\nclaim it does.","PeriodicalId":501024,"journal":{"name":"arXiv - CS - Computational Complexity","volume":"32 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.08495","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.