mlsanityData to 7 Oct 2026

D-Wave's Nonlinear-Program Hybrid Solver: Description and Performance Analysis

arXiv 2410.07980 ↗First posted 10 Oct 2024cs.ET cs.AI quant-phcited by 5

Not on the map. Why?

Abstract (arXiv)

The development of advanced quantum-classical algorithms is among the most prominent strategies in quantum computing. Numerous hybrid solvers have been introduced recently. Many of these methods are created ad hoc to address specific use cases. However, several well-established schemes are frequently utilized to address optimization problems. In this context, D-Wave launched the Hybrid Solver Service in 2020, offering a portfolio of methods designed to accelerate time-to-solution for users aiming to optimize performance and operational processes. Recently, a new technique has been added to this portfolio: the Nonlinear-Program Hybrid Solver. This paper describes this solver and evaluates its performance through a benchmark of 45 instances across three combinatorial optimization problems: the Traveling Salesman Problem, the Knapsack Problem, and the Maximum Cut Problem. To facilitate the use of this relatively unexplored solver, we provide details of the implementation used to solve these three optimization problems.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 16 of its 80 references that are in the map. First posted on arXiv 10 Oct 2024.

Builds on

16 of 80 references.

References · 16

  1. 2024Barren Plateaus in Variational Quantum Computingcited by 130
  2. 2020Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networkscited by 22
  3. 2020Portfolio Optimisation Using the D-Wave Quantum Annealercited by 10
  4. 2023Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealerscited by 7
  5. 2024Solving a Real-World Package Delivery Routing Problem Using Quantum Annealerscited by 6
  6. 2020Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problemcited by 5
  7. 2022Quantum Annealing for Vehicle Routing Problem with weighted Segmentcited by 4
  8. 2024Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computerscited by 4
  9. 2021Focusing on the Hybrid Quantum Computing -- Tabu Search Algorithm: new results on the Asymmetric Salesman Problemcited by 3
  10. 2023Hybrid classical-quantum computing: are we forgetting the classical part in the binomial?cited by 3
  11. 2024QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problemscited by 3
  12. 2022Power network optimization: a quantum approachcited by 2
4 more
  1. 2023Solving Logistic-Oriented Bin Packing Problems Through a Hybrid Quantum-Classical Approachcited by 2
  2. 2021Optimizing decision making for soccer line-up by a quantum annealercited by 1
  3. 2023Optimization of Image Acquisition for Earth Observation Satellites via Quantum Computingcited by 1
  4. 2024Exploring Utility in a Real-World Warehouse Optimization Problem: Formulation Based on Quantum Annealers and Preliminary Resultscited by 1

Built on by

Cited by year

Citing papers per year: 2025: 5.

5 papers.

  1. 2025Transfer of Knowledge through Reverse Annealing: A Preliminary Analysis of the Benefits and What to Sharecited by 0
  2. 2025Solving Drone Routing Problems with Quantum Computing: A Hybrid Approach Combining Quantum Annealing and Gate-Based Paradigmscited by 0
  3. 2025Addressing the Minor-Embedding Problem in Quantum Annealing and Evaluating State-of-the-Art Algorithm Performancecited by 0
  4. 2025Quantum-Assisted Automatic Path-Planning for Robotic Quality Inspection in Industry 4.0cited by 0
  5. 2025Quantum Annealing for Staff Scheduling in Educational Environmentscited by 0