Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis

  title={Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis},
  author={Ojas Parekh and Jeremy D. Wendt and Luke Shulenburger and Andrew J. Landahl and Jonathan Edward Moussa and John Bahram Aidun},
  journal={arXiv: Quantum Physics},
We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computational devices at vastly different stages of technological maturity. We critically evaluate and offer our own contributions to current quantum benchmarking efforts, in particular those involving adiabatic quantum computation and the Adiabatic Quantum Optimizers produced by D-Wave Systems, Inc. We find that… Expand
Benchmarking a quantum annealing processor with the time-to-target metric
In the evaluation of quantum annealers, metrics based on ground state success rates have two major drawbacks. First, evaluation requires computation time for both quantum and classical processorsExpand
Evaluating Ising Processing Units with Integer Programming
The proposed validation methodology is demonstrated on a D-Wave 2X adiabatic quantum computer and it is suggested that as IPU technology matures it could become a valuable co-processor in hybrid-optimization algorithms. Expand
The potential of quantum annealing for rapid solution structure identification
This work provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantumAnnealing and state-of-the-art classical approaches. Expand
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
This work has tailored branch-and-cut as well as semidefinite programming algorithms for solving Ising models for Chimera graphs to provable optimality and uses the strength of these approaches for comparing the solution values to those obtained on the current quantum annealing machine D-Wave 2000Q. Expand
Quantum Annealing versus Digital Computing
How reliably the D-Wave computer can deliver true optimum solutions is examined and some surprising results are presented. Expand
Accuracy and minor embedding in subqubo decomposition with fully connected large problems: a case study about the number partitioning problem
This work investigates the capabilities of a hybrid quantum-classical procedure to explore the solution space using the D-Wave 2000 Q T M quantum annealer device and finds remarkable results in most instances of the model. Expand
Principles and Guidelines for Quantum Performance Analysis
Expanding access to practical quantum computers prompts a widespread need to evaluate their performance. Principles and guidelines for carrying out sound empirical work on quantum computing systemsExpand
First Results Solving Arbitrarily Structured Maximum Independent Set Problems Using Quantum Annealing
It is found that the QPU can be used as a heuristic optimizer for randomly generated inputs, but due to physical control errors, can be outperformed by simulated thermal annealing. Expand
Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization
This work maps the recurrent neural network to a commercially available quantum processing unit by taking advantage of the common underlying Ising spin model, and assesses the accuracy of the quantum processor to store key-value associations by quantifying recall performance against an ensemble of problem sets. Expand
A Quantum Computational Approach to Correspondence Problems on Point Sets
A new algorithm for correspondence problems on point sets suitable for execution on adiabatic quantum computers is derived and has a subquadratic computational complexity of the state preparation. Expand


Defining and detecting quantum speedup
Here, it is shown how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup, and the subtle nature of the quantum speed up question is illustrated. Expand
A quantum annealing approach for fault detection and diagnosis of graph-based systems
This work is the first research utilizing the route Problem → QUBO → Direct embedding into quantum hardware, where it is able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. Expand
Error-corrected quantum annealing with hundreds of qubits.
A substantial improvement over the performance of the processors in the absence of error correction is demonstrated, paving the way towards large-scale noise-protected adiabatic quantum optimization devices, although a threshold theorem such as has been established in the circuit model of quantum computing remains elusive. Expand
Performance of a quantum annealer on range-limited constraint satisfaction problems
The hypothesis that performance of D-Wave Vesuvius processors is heavily influenced by analog control error, which can be reduced and mitigated as the technology matures is supported. Expand
Consistency tests of classical and quantum models for a quantum annealer
Recently the question of whether the D-Wave processors exhibit large-scale quantum behavior or can be described by a classical model has attracted significant interest. In this work we address thisExpand
Entanglement in a Quantum Annealing Processor
Abstract : Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides aExpand
Quantum annealing with manufactured spins
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems. Expand
Discrete optimization using quantum annealing on sparse Ising models
A way of finding energy representations with large classical gaps between ground and first excited states, efficient algorithms for mapping non-compatible Ising models into the hardware, and the use of decomposition methods for problems that are too large to fit in hardware are proposed. Expand
Quantum search by local adiabatic evolution
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, whichExpand
A Performance Estimator for Quantum Annealers: Gauge selection and Parameter Setting
With the advent of large-scale quantum annealing devices, several challenges have emerged. For example, it has been shown that the performance of a device can be significantly affected by severalExpand