Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms (2023)

First Author: Mirkarimi Puya

Attributed to: EPSRC Hub in Quantum Computing and Simulation funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1103/physrevresearch.5.023151

Publication URI: http://dx.doi.org/10.1103/physrevresearch.5.023151

Volume: 5

Parent Publication: Phys.Rev.Res.

Issue: 2