Heterogeneous quantum computing for satellite constellation optimization: solving the weighted<i>k</i>-clique problem
Heterogeneous quantum computing for satellite constellation optimization: solving the weighted<i>k</i>-clique problem
NP-hard optimization problems scale very rapidly with problem size, becoming unsolvable with brute force methods, even with supercomputing resources.Typically, such problems have been approximated with heuristics.However, these methods still take a long time and are not guaranteed to find an optimal solution.Quantum computing offers the possibility of producing significant speed-up …