mlsanityData to 14 Oct 2026

Efficient correlation-based discretization of continuous variables for annealing machines

arXiv 2301.07244 ↗First posted 18 Jan 2023quant-ph cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Annealing machines specialized for combinatorial optimization problems have been developed, and some companies offer services to use those machines. Such specialized machines can only handle binary variables, and their input format is the quadratic unconstrained binary optimization (QUBO) formulation. Therefore, discretization is necessary to solve problems with continuous variables. However, there is a severe constraint on the number of binary variables with such machines. Although the simple binary expansion in the previous research requires many binary variables, we need to reduce the number of such variables in the QUBO formulation due to the constraint. We propose a discretization method that involves using correlations of continuous variables. We numerically show that the proposed method reduces the number of necessary binary variables in the QUBO formulation without a significant loss in prediction accuracy.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 18 references that are in the map. First posted on arXiv 18 Jan 2023.

Builds on

7 of 18 references.

References · 7

  1. 2013Ising formulations of many NP problemscited by 207
  2. 2019Support vector machines on the D-Wave quantum annealercited by 33
  3. 2017Traffic flow optimization using a quantum annealercited by 29
  4. 2020Adiabatic Quantum Linear Regressioncited by 17
  5. 2018Control of automated guided vehicles without collision by quantum annealer and digital devicescited by 13
  6. 2020Balanced k-Means Clustering on an Adiabatic Quantum Computercited by 9
  7. 2019Item Listing Optimization for E-commerce Websites based on Diversitycited by 8

Built on by

Not cited yet.