Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

Those that solve artificially simplified problems where quantum advantage is meaningless. Those that provide no genuine quantum advantage when all costs are properly accounted for. This critique is ...