Encoding-independent optimization problem formulation for quantum computing
Open Access
- 7 September 2023
- journal article
- review article
- Published by Frontiers Media SA in Frontiers in Quantum Science and Technology
- Vol. 2, 1229471
Abstract
We review encoding and hardware-independent formulations of optimization problems for quantum computing. Using this generalized approach, an extensive library of optimization problems from the literature and their various derived spin encodings are discussed. Common building blocks that serve as a construction kit for formulating these spin Hamiltonians are provided. This previously introduced approach paves the way toward a fully automatic construction of Hamiltonians for arbitrary discrete optimization problems and this freedom in the problem formulation is a key step for tailoring optimal spin Hamiltonians for different hardware platforms.Keywords
All Related Versions
Funding Information
- Austrian Science Fund (Y1067-N27)
This publication has 78 references indexed in Scilit:
- Solving the optimal trading trajectory problem using a quantum annealer2015
- Financial Networks and ContagionAmerican Economic Review, 2014
- The unconstrained binary quadratic programming problem: a surveyJournal of Combinatorial Optimization, 2014
- Quantum simulationReviews of Modern Physics, 2014
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Properties of Numeric Codes for the Scheme of Random Subspaces RSCCybernetics and Systems Analysis, 2005
- Ant colony optimization: a new meta-heuristic2003
- On Generating Random Intervals and HyperrectanglesJournal of Computational and Graphical Statistics, 1993
- On the Complexity of Derivation in Propositional Calculus1983
- Computational Complexity of Discrete Optimization Problems1979