Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
Elijah Pelofske, Georg Hahn, Hristo Djidjev
Topics & Concepts
Vertex coverPruningAlgorithmCliqueVertex (graph theory)Computer scienceQuantum computerClique problemReduction (mathematics)Set (abstract data type)Cover (algebra)Quantum algorithmGraphDecompositionQuantumDegeneracy (biology)Set cover problemApproximation algorithmIndependent setComputational complexity theoryMathematicsFeedback vertex setMathematical optimizationMaximum cutTheoretical computer scienceGraph theoryHeuristicsOptimization problemMaxima and minimaTime complexityParameterized complexityMinimum cutMinificationQuadratic unconstrained binary optimizationSearch algorithmMonotonic functionQuantum Computing Algorithms and ArchitectureComplexity and Algorithms in GraphsRadiation Effects in Electronics