all InfoSec news
BQP $\neq$ QMA
May 22, 2023, 6:54 a.m. |
IACR News www.iacr.org
ePrint Report: BQP $\neq$ QMA
Ping Wang, Yiting Su
The relationship between complexity classes BQP and QMA is analogous to the relationship between P and NP. In this paper, we design a quantum bit commitment problem that is in QMA, but not in BQP. Therefore, it is proved that BQP $\neq$ QMA. That is, problems that are verifiable in quantum polynomial time are not necessarily solvable in quantum polynomial time, the quantum analog of P $\neq$ NP.
complexity design eprint report ping problem problems quantum relationship report
More from www.iacr.org / IACR News
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
IT Security Manager
@ Teltonika | Vilnius/Kaunas, VL, LT
Security Officer - Part Time - Harrah's Gulf Coast
@ Caesars Entertainment | Biloxi, MS, United States
DevSecOps Full-stack Developer
@ Peraton | Fort Gordon, GA, United States
Cybersecurity Cooperation Lead
@ Peraton | Stuttgart, AE, United States
Cybersecurity Engineer - Malware & Forensics
@ ManTech | 201DU - Customer Site,Herndon, VA