Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing

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 on the Maximum Clique problem on graphs with up to 120 nodes and 6395 edges.

References in corpus (4)

• Mathematical Foundation of Quantum Annealing
• A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems
• Simultaneous execution of quantum circuits on current and near-future NISQ systems
• Parallel Quantum Annealing

Cited by in corpus (9)

• Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits
• Hybrid Optimization Method Using Simulated-Annealing-Based Ising Machine and Quantum Annealer
• Optimization of ionic configurations in battery materials by quantum annealing
• Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm
• Advantages of fixing spins in quantum annealing
• Quantum computing and the stable set problem
• Comparing Quantum Annealing and Spiking Neuromorphic Computing for Sampling Binary Sparse Coding QUBO Problems
• Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
• Multi-tasking through quantum annealing