关于 NP 难问题和 BQP 的最新说法的简要说明

arXiv - CS - Computational Complexity Pub Date : 2024-04-25 DOI:arxiv-2406.08495

Michael C. Chavrimootoo

{"title":"关于 NP 难问题和 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":"{\"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}","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

摘要

这篇短文概述了 Czerwinski 声称 NP 难问题不在 BQP 中的论文 [Cze23]中的一些问题。我们概述了一个主要问题和两个次要问题，并得出结论：他们的论文并没有证实他们所宣称的内容。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Computational Complexity

自引率

0.00%

发文量