Quantum Information Processing · 2023 · 27 citations · 43 references
ComputingComputer ScienceAlgorithmsOptimizationParallel AlgorithmsCombinatorial OptimizationGraph AlgorithmsQuantum AlgorithmsQuantum AnnealingQuantum BitsQuantum Hardware ArchitecturesClique AlgorithmsEmbedding TechniquesLarge-scale Sparse OptimizationMinor EmbeddingNp-complete ProblemsNp-hardnessQuadratic OptimizationQuantum Hardware Embedding
Abstract Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave Systems, which we consider in this work, is sparsely connected and moderately sized (on the order of thousands of qubits), thus necessitating a minor-embedding of a logical problem onto the physical qubit hardware. The combination of relatively small hardware sizes and the necessity of a minor-embedding can mean that solving large optimization problems is not possible on current quantum annealers. In this research, we show that a hybrid approach combining parallel quantum annealing with graph decomposition allows one to solve larger optimization problem accurately. We apply the approach to the Maximum Clique problem on graphs with up to 120 nodes and 6395 edges.
43
Quantum Computing in the NISQ era and beyond
John Preskill · Quantum · 2018 · 8.2K citations · Full text
Computing, Computer Science, Physics +17
Ising formulations of many NP problems
Andrew Lucas · Frontiers in Physics · 2014 · 2.5K citations · Full text
Computing, Computer Science, Physics +15
Algorithm 457: finding all cliques of an undirected graph
Coen Bron, Joep Kerbosch · Communications of the ACM · 1973 · 2.5K citations · Full text