Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
(2023)
Journal Article
Mirkarimi, P., Callison, A., Light, L., Chancellor, N., & Kendon, V. (2023). Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms. Physical Review Research, 5(2), https://doi.org/10.1103/physrevresearch.5.023151
An algorithm for a particular problem may find some instances of the problem easier and others harder to solve, even for a fixed input size. We numerically analyze the relative hardness of MAX 2-SAT problem instances for various continuous-time quant... Read More about Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms.