Quantum isomer search

  title={Quantum isomer search},
  author={Jason Patrick Terry and Prosper D. Akrobotu and Christian Francisco Andres Negre and Susan M. Mniszewski},
  journal={PLoS ONE},
Isomer search or molecule enumeration refers to the problem of finding all the isomers for a given molecule. Many classical search methods have been developed in order to tackle this problem. However, the availability of quantum computing architectures has given us the opportunity to address this problem with new (quantum) techniques. This paper describes a quantum isomer search procedure for determining all the structural isomers of alkanes. We first formulate the structural isomer search… 

Figures and Tables from this paper

Multilevel Combinatorial Optimization across Quantum Architectures
This article advocates the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms and develops hybrid multileVEL solvers with quantum local search on D-Wave’s quantum annealer and IBM's gate-model based quantum processor.
Vacancies in graphene: an application of adiabatic quantum optimization.
A simple model is used, compatible with the capability of current quantum annealers, to study the relative stability of graphene vacancy defects, and provides a stepping stone towards applications of quantumAnnealing to problems of physical-chemical interest.
Compressed Quadratization of Higher Order Binary Optimization Problems
This work proves that in Ising space the degree reduction of one term requires the introduction of two variables, which results in a more compact representation of the resultant QUBO problem, which is crucial for utilizing resource-constrained QUBO solvers.
On Modeling Local Search with Special-Purpose Combinatorial Optimization Hardware
This paper tackles the main challenges of problem size and precision limitation that the Ising hardware model typically suffers from and can be generally used in any local search and refinement solvers that are broadly employed in combinatorial scientific computing algorithms.
A multi-commodity network model for optimal quantum reversible circuit synthesis
An application of an optimization model for synthesizing quantum circuits with minimum implementation costs to lower the error rates by forming a simpler circuit, which has a unique structure that combines the arc-subset selection problem with a conventional multi-commodity network flow model.
Limitations of existing solvers on many dense graphs as well as those of the Digital Annealer on sparse graphs are demonstrated which opens an avenue to hybridize these approaches.
Combinatorial Optimization with Physics-Inspired Graph Neural Networks
The graph neural network optimizer performs on par or outperforms existing solvers, with the ability to scale beyond the state of the art to problems with millions of variables.
Leveraging special-purpose hardware for local search heuristics
This work proposes a new meta-heuristic to model local search in the Ising form for the special-purpose hardware devices, and demonstrates that this method takes the limitations of the Ised model and current hardware into account, and utilizes a given hardware more efficiently compared to previous approaches, while also producing high quality solutions compared to other well-known meta- heuristics.
A QUBO Formulation for Eigencentrality
This work lays the foundations for the calculation of eigenvector centrality using quantum computational paradigms such as quantum annealing and gate-based quantum computing, reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures.
Towards Hybrid Classical-Quantum Computation Structures in Wirelessly-Networked Systems
The feasibility of a hybrid system with a real hardware prototype using one of the most advanced experimentally available techniques today, reverse quantum annealing is explored, showing approximately 2-10x better performance in terms of processing time than prior published results.


Stochastic Generator of Chemical Structure, 2. Using Simulated Annealing To Search the Space of Constitutional Isomers
  • J. Faulon
  • Computer Science
    J. Chem. Inf. Comput. Sci.
  • 1996
A stochastic algorithm based on the simulated annealing method that searches constitutional isomers with desired properties and is general enough to be used for any class of organic and inorganic compounds, including cyclic and cross-linked structures.
Exhaustive generation of organic isomers. 1. Acyclic structures
The system reported here describes selective, exhaustive, and nonredundant generation and counting algorithms for acyclic connectivity isomers associated with any molecular formula, which is of great utility in structure elucidation, in organic synthesis, and especially in molecular design.
Graph Partitioning using Quantum Annealing on the D-Wave System
Results for graph partitioning using quantum and hybrid classical-quantum approaches are shown to be comparable to current "state of the art" methods and sometimes better.
Quantum-Assisted Genetic Algorithm
Reverse quantum annealing enables the development of genetic algorithms that use quantum fluctuation for mutations and classical mechanisms for the crossovers -- these are referred to as Quantum-Assisted Genetic Algorithms (QAGAs).
What is the Computational Value of Finite Range Tunneling
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.
A Quantum Approximate Optimization Algorithm
A quantum algorithm that produces approximate solutions for combinatorial optimization problems that depends on a positive integer p and the quality of the approximation improves as p is increased, and is studied as applied to MaxCut on regular graphs.
A Tutorial on Formulating QUBO Models
It is shown how many different types of constraints arising in practice can be embodied within the “unconstrained” QUBO formulation in a very natural manner using penalty functions, yielding exact model representations in contrast to the approximate representations produced by customary uses of penalty functions.
A variational eigenvalue solver on a photonic quantum processor
The proposed approach drastically reduces the coherence time requirements and combines this method with a new approach to state preparation based on ansätze and classical optimization, enhancing the potential of quantum resources available today and in the near future.
Subspace-search variational quantum eigensolver for excited states
The variational quantum eigensolver (VQE), a variational algorithm to obtain an approximated ground state of a given Hamiltonian, is an appealing application of near-term quantum computers. The
Detecting multiple communities using quantum annealing on the D-Wave system
It turns out that the problem of detecting at most two communities naturally fits into the architecture of a quantum annealer with almost no need of reformulation.