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

First Author: Mirkarimi P

Attributed to: Hybrid quantum and classical computation: exploiting the best of both paradigms funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.2206.06876

Publication URI: https://arxiv.org/abs/2206.06876

Type: Other