Boosting Quantum Annealer Performance via Quantum Persistence

By Hamed Karimi & Gili Rosenberg

We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer to fix the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are usually much easier for the quantum annealer to solve, due to their being smaller and consisting of disconnected components. This approach significantly increases the success rate and number of observations of the best known energy value in samples obtained from the quantum annealer, when compared with calling the quantum annealer without using it, even when using fewer annealing cycles. Use of the method results in a considerable improvement in success metrics even for problems with high-precision couplers and biases, which are more challenging for the quantum annealer to solve. The results are further enhanced by applying the method iteratively and combining it with classical pre-processing. We present results for both Chimera graph-structured problems and embedded problems from a real-world application.

Presented at: Adiabatic Quantum Computing Conference 2016 (AQC)

Journal reference: Quantum Information Processing – July 2017

PDF arXiv preprint

← Prime Factorization Using Quantum Annealing and Algebraic Geometry Enhancing Quantum Annealing Performance for the Molecular Similarity Problem →

Most Recent Papers

Variationally Scheduled Quantum Simulation

Mar 22, 2020

By Shunji Matsuura, Samantha Buck, Valentin Senicourt, & Arman Zaribafiyan Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of a given system is by employing adiabatic state preparation...

Scaling Up Electronic Structure Calculations on Quantum Computers: The Frozen Natural Orbital Based Method of Increments

Feb 18, 2020

By Prakash Verma, Lee Huntington, Marc Coons, Yukio Kawashima, Takeshi Yamazaki, & Arman Zaribafiyan Quantum computing is a new computing paradigm that holds great promise for the efficient simulation of quantum mechanical systems. However, the hardware envelope...

Effects of Setting the Temperatures in the Parallel Tempering Monte Carlo Algorithm

Nov 8, 2019

By Ignacio Rozada, Maliheh Aramon, Jonathan Machta, & Helmut G. Katzgraber Parallel tempering Monte Carlo has proven to be an efficient method in optimization and sampling applications. Having an optimized temperature set enhances the efficiency of the algorithm...

Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized Features

Sep 17, 2019

By Moslem Noori, Seyed Shakib Vedaie, Inderpreet Singh, Daniel Crawford, Jaspreet S. Oberoi, Barry C. Sanders, & Ehsan Zahedinejad Quantum information processing is likely to have far-reaching impact in the field of artificial intelligence. While the race to build...

A Quantum Annealing-Based Approach to Extreme Clustering

Sep 11, 2019

By Tim Jaschek, Marko Bucyk, & Jaspreet S. Oberoi Clustering, or grouping, dataset elements based on similarity can be used not only to classify a dataset into a few categories, but also to approximate it by a relatively large number of representative elements. In...