Enhancing Quantum Annealing Performance for the Molecular Similarity Problem

Abstract

Quantum annealing is a promising technique which leverages quantum mechanics to solve hard optimization problems. Considerable progress has been made in the development of a physical quantum annealer, motivating the study of methods to enhance the efficiency of such a solver. In this work, we present a quantum annealing approach to measure similarity among molecular structures. Implementing real-world problems on a quantum annealer is challenging due to hardware limitations such as sparse connectivity, intrinsic control error, and limited precision. In order to overcome the limited connectivity, a problem must be reformulated using minor-embedding techniques. Using a real data set, we investigate the performance of a quantum annealer in solving the molecular similarity problem. We provide experimental evidence that common practices for embedding can be replaced by new alternatives which mitigate some of the hardware limitations and enhance its performance. Common practices for embedding include minimizing either the number of qubits or the chain length, and determining the strength of ferromagnetic couplers empirically. We show that current criteria for selecting an embedding do not improve the hardware's performance for the molecular similarity problem. Furthermore, we use a theoretical approach to determine the strength of ferromagnetic couplers. Such an approach removes the computational burden of the current empirical approaches, and also results in hardware solutions that can benefit from simple local classical improvement. Although our results are limited to the problems considered here, they can be generalized to guide future benchmarking studies.

References in corpus (6)

• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• A practical heuristic for finding graph minors
• Algorithm engineering for a quantum annealing platform
• On Quadratization of Pseudo-Boolean Functions
• A Performance Estimator for Quantum Annealers: Gauge selection and Parameter Setting
• Efficient subgraph-based sampling of Ising-type models with frustration

Cited by in corpus (23)

• Perspectives of quantum annealing: Methods and implementations
• Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
• Quantum Annealing for Industry Applications: Introduction and Review
• Molecular Docking with Gaussian Boson Sampling
• Leveraging Quantum Annealing for Large MIMO Processing in Centralized Radio Access Networks
• Optimal Control of Traffic Signals using Quantum Annealing
• Basic Elements for Simulations of Standard Model Physics with Quantum Annealers: Multigrid and Clock States
• Item Listing Optimization for E-commerce Websites based on Diversity
• Effective electromagnetic actions for Lorentz violating theories exhibiting the axial anomaly
• Partitioning Dense Graphs with Hardware Accelerators
• Viewing Vanilla Quantum Annealing Through Spin Glasses
• A Quantum-Inspired Method for Three-Dimensional Ligand-Based Virtual Screening
• Preparing ground states of the XXZ model using the quantum annealing with inductively coupled superconducting flux qubits
• Dynamics of Order Parameters of Non-stoquastic Hamiltonians in the Adaptive Quantum Monte Carlo Method
• Feeding the multitude: A polynomial-time algorithm to improve sampling
• Quantum annealing approach to Ionic Diffusion in Solid
• Message-passing algorithm of quantum annealing with nonstoquastic Hamiltonian
• Quantum annealing with pairs of ${}^2\Sigma$ molecules as qubits
• Analyzing the Effectiveness of Quantum Annealing with Meta-Learning
• Computing Canonical Averages with Quantum and Classical Optimizers: Thermodynamic Reweighting for QUBO Models of Physical Systems
• Minor Embedding for Quantum Annealing with Reinforcement Learning
• Quantitative analysis of the effectiveness of mid-anneal measurement in quantum annealing
• Assessment of image generation by quantum annealer