A Performance Estimator for Quantum Annealers: Gauge selection and Parameter Setting

Abstract

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 several degrees of freedom when programming the device; a common example being gauge selection. To date, no experimentally-tested strategy exists to select the best programming specifications. We developed a score function that can be calculated from a number of readouts much smaller than the number of readouts required to find the desired solution. We show how this performance estimator can be used to guide, for example, the selection of the optimal gauges out of a pool of random gauge candidates and how to select the values of parameters for which we have no a priori knowledge of the optimal value. For the latter, we illustrate the concept by applying the score function to set the strength of the parameter intended to enforce the embedding of the logical graph into the hardware architecture, a challenge frequently encountered in the implementation of real-world problem instances. Since the harder the problem instances, the more useful the strategies proposed in this work are, we expect the programming strategies proposed to significantly reduce the time of future benchmark studies and in help finding the solution of hard-to-solve real-world applications implemented in the next generation of quantum annealing devices.

10 pages

References in corpus (18)

• Quantum Annealing in the Transverse Ising Model
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum annealing with more than one hundred qubits
• Defining and detecting quantum speedup
• Experimental signature of programmable quantum annealing
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• A practical heuristic for finding graph minors
• Computational Role of Multiqubit Tunneling in a Quantum Annealer
• A case study in programming a quantum annealer for hard operational planning problems
• Error corrected quantum annealing with hundreds of qubits
• Probing for quantum speedup in spin glass problems with planted solutions
• Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
• Reexamining classical and quantum models for the D-Wave One processor
• Bayesian Network Structure Learning Using Quantum Annealing
• Ramsey numbers and adiabatic quantum computing
• Algorithm engineering for a quantum annealing platform
• Performance of a quantum annealer on range-limited constraint satisfaction problems
• Comment on "Distinguishing Classical and Quantum Models for the D-Wave Device"

Cited by in corpus (8)

• Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
• A NASA Perspective on Quantum Computing: Opportunities and Challenges
• Image Acquisition Planning for Earth Observation Satellites with a Quantum Annealer
• Enhancing Quantum Annealing Performance for the Molecular Similarity Problem
• Guiding Principle for Minor-Embedding in Simulated-Annealing-Based Ising Machines
• Fast clique minor generation in Chimera qubit connectivity graphs