Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms (2022)
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.48550/arXiv.2206.06876
Publication URI: http://dx.doi.org/10.48550/arXiv.2206.06876
Type: Journal Article/Review
Parent Publication: arXiv e-prints