Finding Maximum Cliques on the D-Wave Quantum Annealer

@article{Chapuis2019FindingMC,
  title={Finding Maximum Cliques on the D-Wave Quantum Annealer},
  author={Guillaume Chapuis and Hristo N. Djidjev and Georg Hahn and Guillaume Rizk},
  journal={Journal of Signal Processing Systems},
  year={2019},
  volume={91},
  pages={363-377}
}
This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. [] Key Method For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, and compare several quantum implementations to current classical algorithms…
Solving Large Maximum Clique Problems on a Quantum Annealer
TLDR
This article investigates methods for decomposing larger problem instances into smaller ones, which can subsequently be solved on D-Wave, and prune as many generated subproblems that don’t contribute to the solution as possible in order to reduce the computational complexity.
Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
TLDR
A general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices is studied and several pruning and reduction techniques are proposed to speed up the recursive decomposition.
Advanced unembedding techniques for quantum annealers
TLDR
This work presents tailored unembedding techniques for four important NP-hard problems: the Maximum Clique, Maximum Cut, Minimum Vertex Cover, and Graph Partitioning problems, and demonstrates that the proposed algorithms outperform the currently available ones in that they yield solutions of better quality, while being computationally equally efficient.
Parallel quantum annealing
TLDR
This work proposes a novel method, called parallel quantum annealer, to make better use of available qubits, wherein either the same or several independent problems are solved in the same annealing cycle of a quantum anNealer, assuming enough physical qubits are available to embed more than one problem.
Testing a QUBO Formulation of Core-periphery Partitioning on a Quantum Annealer
TLDR
A new kernel that quantifies success for the task of computing a coreperiphery partition for an undirected network is proposed and a sparsified version of the original QUBO is developed which increases the available problem dimension for the quantum annealer.
Reducing quantum annealing biases for solving the graph partitioning problem
TLDR
This work quantifies the bias of the implementation of the constraint on the quantum annealer and proposes an iterative method to correct any biases, and applies this concept to Graph Partitioning, an important NP-hard problem, which asks to find a partition of the vertices of a graph that is balanced and minimizes the cut size.
Optimizing the Spin Reversal Transform on the D-Wave 2000Q
TLDR
This work investigates the effectiveness of the spin reversal transform for D-Wave 2000Q, and considers two important NP-hard problems, the Maximum Clique and the Minimum Vertex Cover problems, and shows on a variety of input problem graphs that using thespin reversal transform can yield substantial improvements in solution quality.
Using Machine Learning for Quantum Annealing Accuracy Prediction
TLDR
This work focuses on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry, and trains a machine learning regression model that predicts the clique size found by D-Wave.
Optimizing the optimizer: decomposition techniques for quantum annealing
TLDR
The results indicate that the Qbsolv algorithm is, at this time, the state-of-the-art in producing quality solutions, in a timely fashion, to a variety of theoretical and real-world problems too large to directly embed onto a quantum annealing device.
Optimizing Embedding-Related Quantum Annealing Parameters for Reducing Hardware Bias
TLDR
This work investigates graph instances of varying densities for the Maximum Clique, Maximum Cut, and Graph Partitioning problems and indicates that substantial improvements of the annealing results can be achieved by using the optimized parameters for SR, AO, and CW.
...
...

References

SHOWING 1-10 OF 46 REFERENCES
Multiple Query Optimization on the D-Wave 2X Adiabatic Quantum Computer
TLDR
This paper shows how an MQO problem instance can be transformed into a mathematical formula that complies with the restrictive input format accepted by the quantum annealer, and finds a class of problem instances where the quantumAnnealer is three orders of magnitude faster than other approaches.
Solving Set Cover with Pairs Problem using Quantum Annealing
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology, and
Discrete optimisation problems on an adiabatic quantum computer
TLDR
A way of mapping more general problems to the subclass of Ising problems in order to make them solvable on an adiabatic quantum computer is presented and the applicability of such machines to the scheduling optimisation of satellite missions performed by the German Aerospace Center is investigated.
Quantum versus simulated annealing in wireless interference network optimization
TLDR
A novel real-world application of D-Wave in wireless networking is focused on, the scheduling of the activation of the air-links for maximum throughput subject to interference avoidance near network nodes, and quantum annealing benefits more than simulated annealer from this gap expansion process, both in terms of ST99 speedup and network queue occupancy.
Fast clique minor generation in Chimera qubit connectivity graphs
TLDR
A combinatorial class of native clique minors in Chimera graphs with vertex images of uniform, near minimal size are defined and a polynomial-time algorithm is provided that finds a maximumnative clique minor in a given induced subgraph of a Chimera graph.
Traffic Flow Optimization Using a Quantum Annealer
TLDR
This paper shows how to map certain parts of the real-world traffic flow optimization problem to be suitable for quantum annealing, and shows that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum applications.
Benchmarking a quantum annealing processor with the time-to-target metric
TLDR
D-Wave’s latest quantum annealer, the D-Wave 2X system, is evaluated on an array of problem classes and it is found that it performs well on several input classes relative to state of the art software solvers running single-threaded on a CPU.
What is the Computational Value of Finite Range Tunneling
TLDR
It is demonstrated how finite range tunneling can provide considerable computational advantage over classical processors for a crafted problem designed to have tall and narrow energy barriers separating local minima, the D-Wave 2X quantum annealer achieves significant runtime advantages relative to Simulated Annealing.
Readiness of Quantum Optimization Machines for Industrial Applications
TLDR
Although the results show that transverse-field quantum annealing is outperformed by state-of-the-art classical optimization algorithms, these benchmark instances are hard and small in the size of the input, therefore representing the first industrial application ideally suited for testing near-term Quantum annealers and other quantum algorithmic strategies for optimization problems.
Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics
TLDR
The paper provides a rigorous definition as well as a mathematical justification of this graph partitioning problem and uses several algorithms to compute graph partitions and experimentally evaluates their performance with respect to the quality of the partition obtained with each method and the time needed to produce it.
...
...