Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2101.06250 · Nature Communications

Enhancing combinatorial optimization with classical and quantum generative models

Javier A. Alcazar, Mohammad Ghazi Vakili, Can B. Kalaycı, Alejandro Perdomo‐Ortiz

Published Mar 29, 2024• 60 citations
arXivHTMLPDF

Abstract

Abstract Devising an efficient exploration of the search space is one of the key challenges in the design of combinatorial optimization algorithms. Here, we introduce the Generator-Enhanced Optimization (GEO) strategy: a framework that leverages any generative model (classical, quantum, or quantum-inspired) to solve optimization problems. We focus on a quantum-inspired version of GEO relying on tensor-network Born machines, and referred to hereafter as TN-GEO. To illustrate our results, we run these benchmarks in the context of the canonical cardinality-constrained portfolio optimization problem by constructing instances from the S&P 500 and several other financial stock indexes, and demonstrate how the generalization capabilities of these quantum-inspired generative models can provide real value in the context of an industrial application. We also comprehensively compare state-of-the-art algorithms and show that TN-GEO is among the best; a remarkable outcome given the solvers used in the comparison have been fine-tuned for decades in this real-world industrial application. Also, a promising step toward a practical advantage with quantum-inspired models and, subsequently, with quantum generative models

DOI
10.1038/s41467-024-46959-5

Related papers

Enhancing Combinatorial Optimization with Quantum Generative Models

Javier A. Alcazar, Alejandro Perdomo‐Ortiz

Combinatorial optimization is one of the key candidates in the race for practical quantum advantage. In this work, we introduce a new family of quantum-enhanced optimizers and demonstrate how quantum machine learning models known as quantum generative models can find lower minima than those found by means of stand-alone state-of-the-art classical solvers. We present two new quantum-enhanced optimization strategies. The first scheme leverages data points evaluated during the optimization search from any quantum or classical optimizer. In this scheme, we show how our quantum generative model boosts the performance of classical solvers in hard-to-solve instances where the classical solver is not capable of making progress as a stand-alone strategy. The second quantum optimization strategy works as a stand-alone solver. Here we show its superior performance when the goal is to find the best minimum within the least number of cost function evaluations. Under this setting, we benchmark our quantum-enhanced optimization strategies against several solvers, including Bayesian optimizers which are known to be one of the best competing solvers in such tasks. To illustrate our findings, these benchmarks are performed in the context of the portfolio optimization problem by constructing instances from the S&P 500 stock market index. We show that our quantum-inspired generative models based on tensor networks generalize to unseen candidates with lower cost function values than any of the candidates seen by the classical solvers. This is the first demonstration of the generalization capabilities of quantum generative models that brings real value in the context of an industrial-scale application.

•Jan 15, 2021•4 citations

Symmetric tensor networks for generative modeling and constrained combinatorial optimization

Javier Lopez-Piqueres, Jing Chen, Alejandro Perdomo‐Ortiz

Abstract Constrained combinatorial optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In some heuristic solvers, these are typically addressed by introducing certain Lagrange multipliers in the cost function, by relaxing them in some way, or worse yet, by generating many samples and only keeping valid ones, which leads to very expensive and inefficient searches. In this work, we encode arbitrary integer-valued equality constraints of the form A x ⃗ = b ⃗ , directly into U(1) symmetric tensor networks (TNs) and leverage their applicability as quantum-inspired generative models to assist in the search of solutions to combinatorial optimization problems within the generator-enhanced optimization framework of Alcazar et al (2021 arXiv: 2101.06250 ). This allows us to exploit the generalization capabilities of TN generative models while constraining them so that they only output valid samples. Our constrained TN generative model efficiently captures the constraints by reducing number of parameters and computational costs. We find that at tasks with constraints given by arbitrary equalities, symmetric matrix product states outperform their standard unconstrained counterparts at finding novel and better solutions to combinatorial optimization problems.

arXiv:2211.09121•Machine Learning Science and Technology•Jun 24, 2023•18 citations

Generalization metrics for practical quantum advantage in generative models

Kaitlin Gili, Marta Mauri, Alejandro Perdomo‐Ortiz

As the quantum computing community gravitates towards understanding the practical benefits of quantum computers, having a clear definition and evaluation scheme for assessing practical quantum advantage in the context of specific applications is paramount. Generative modeling, for example, is a widely accepted natural use case for quantum computers, and yet has lacked a concrete approach for quantifying success of quantum models over classical ones. In this work, we construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Using the sample-based approach proposed here, any generative model, from state-of-the-art classical generative models such as generative adversarial networks (GANs) to quantum models such as quantum circuit born machines, can be evaluated under the same conditions on a concrete well-defined framework. In contrast to other sample-based metrics for probing practical generalization, we leverage constrained optimization problems (e.g., cardinality-constrained problems) and use these discrete datasets to define specific metrics capable of unambiguously measuring the quality of the samples and the model's generalization capabilities for generating data beyond the training set, but still within the valid solution space. Additionally, our metrics can diagnose trainability issues such as mode collapse and overfitting, as we illustrate when comparing GANs to quantum-inspired models built out of tensor networks. Our simulation results show that our quantum-inspired models have up to a 68 times enhancement in generating unseen unique and valid samples compared to the GANs explored here, and a ratio of 61:2 for generating samples with better quality than those observed in the training set. We foresee these metrics as valuable tools for rigorously defining practical quantum advantage in the domain of generative modeling, where finding a winning model remains an ongoing challenge as new architectures are developed.

arXiv:2201.08770•Physical Review Applied•Apr 17, 2024•45 citations

Quantum-Inspired optimization algorithms: Bridging classical computation and quantum principles for complex problem solving

Kuldoshjon Juraev, Bobir Zokirov, Madina Kholikova +2 more

This study explores quantum-inspired optimization algorithms (QIOAs) as practical tools for solving constrained combinatorial problems on classical machines. We analyze tasks that can be formulated in Ising or QUBO forms and benchmark three representative approaches: Simulated Bifurcation (SB), Quantum-Inspired Particle Swarm Optimization (QPSO), and a tensor-network (TN) method. A unified evaluation protocol is introduced that captures solution quality, feasibility, runtime, energy consumption, parameter sensitivity, and scalability. To ensure reliable performance, we develop automated penalty-adjustment and schedule-calibration strategies. Experimental results across diverse benchmarks show that SB and TN together yield the best trade-offs between accuracy and runtime: SB is efficient on dense instances with moderate penalties and low energy use, while TN is advantageous for sparse or modular networks, especially on GPUs. QPSO is competitive in smoother landscapes but more sensitive to hyperparameters. By linking performance to structural properties such as spectral gaps and constraint activity, we provide guidance for selecting suitable algorithms. Overall, QIOAs emerge as effective intermediaries between existing classical heuristics and emerging quantum devices, supported by a reproducible, energy-aware evaluation framework.

AIP conference proceedings•Jan 1, 2026•0 citations

Quantum Inspired Optimization for Industrial Scale Problems

William P. Banner, Shima Bab Hadiashar, Grzegorz J. Mazur +7 more

Model-based optimization, in concert with conventional black-box methods, can quickly solve large-scale combinatorial problems. Recently, quantum-inspired modeling schemes based on tensor networks have been developed which have the potential to better identify and represent correlations in datasets. Here, we use a quantum-inspired model-based optimization method TN-GEO to assess the efficacy of these quantum-inspired methods when applied to realistic problems. In this case, the problem of interest is the optimization of a realistic assembly line based on BMW's currently utilized manufacturing schedule. Through a comparison of optimization techniques, we found that quantum-inspired model-based optimization, when combined with conventional black-box methods, can find lower-cost solutions in certain contexts.

arXiv:2305.02179•May 3, 2023•8 citations

Quick design of feasible tensor networks for constrained combinatorial optimization

Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka

Quantum computers are expected to enable fast solving of large-scale combinatorial optimization problems. However, their limitations in fidelity and the number of qubits prevent them from handling real-world problems. Recently, a quantum-inspired solver using tensor networks has been proposed, which works on classical computers. Particularly, tensor networks have been applied to constrained combinatorial optimization problems for practical applications. By preparing a specific tensor network to sample states that satisfy constraints, feasible solutions can be searched for without the method of penalty functions. Previous studies have been based on profound physics, such as U(1) gauge schemes and high-dimensional lattice models. In this study, we devise to design feasible tensor networks using elementary mathematics without such a specific knowledge. One approach is to construct tensor networks with nilpotent-matrix manipulation. The second is to algebraically determine tensor parameters. We showed mathematically that such feasible tensor networks can be constructed to accommodate various types of constraints. For the principle verification, we numerically constructed a feasible tensor network for facility location problem, to find much faster construction than conventional methods. Then, by performing imaginary time evolution, feasible solutions were always obtained, ultimately leading to the optimal solution.

arXiv:2409.01699•Quantum•Jul 21, 2025•6 citations
Abstract Devising an efficient exploration of the search space is one of the key challenges in the design of combinatorial optimization algorithms. Here, we introduce the Generator-Enhanced Optimization (GEO) strategy: a framework that leverages any generative model (classical, quantum, or quantum-inspired) to solve optimization problems. We focus on a quantum-inspired version of GEO relying on tensor-network Born machines, and referred to hereafter as TN-GEO. To illustrate our results, we run these benchmarks in the context of the canonical cardinality-constrained portfolio optimization problem by constructing instances from the S&P 500 and several other financial stock indexes, and demonstrate how the generalization capabilities of these quantum-inspired generative models can provide real value in the context of an industrial application. We also comprehensively compare state-of-the-art algorithms and show that TN-GEO is among the best; a remarkable outcome given the solvers used in the comparison have been fine-tuned for decades in this real-world industrial application. Also, a promising step toward a practical advantage with quantum-inspired models and, subsequently, with quantum generative models
Combinatorial optimization is one of the key candidates in the race for practical quantum advantage. In this work, we introduce a new family of quantum-enhanced optimizers and demonstrate how quantum machine learning models known as quantum generative models can find lower minima than those found by means of stand-alone state-of-the-art classical solvers. We present two new quantum-enhanced optimization strategies. The first scheme leverages data points evaluated during the optimization search from any quantum or classical optimizer. In this scheme, we show how our quantum generative model boosts the performance of classical solvers in hard-to-solve instances where the classical solver is not capable of making progress as a stand-alone strategy. The second quantum optimization strategy works as a stand-alone solver. Here we show its superior performance when the goal is to find the best minimum within the least number of cost function evaluations. Under this setting, we benchmark our quantum-enhanced optimization strategies against several solvers, including Bayesian optimizers which are known to be one of the best competing solvers in such tasks. To illustrate our findings, these benchmarks are performed in the context of the portfolio optimization problem by constructing instances from the S&P 500 stock market index. We show that our quantum-inspired generative models based on tensor networks generalize to unseen candidates with lower cost function values than any of the candidates seen by the classical solvers. This is the first demonstration of the generalization capabilities of quantum generative models that brings real value in the context of an industrial-scale application.
Abstract Constrained combinatorial optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In some heuristic solvers, these are typically addressed by introducing certain Lagrange multipliers in the cost function, by relaxing them in some way, or worse yet, by generating many samples and only keeping valid ones, which leads to very expensive and inefficient searches. In this work, we encode arbitrary integer-valued equality constraints of the form A x ⃗ = b ⃗ , directly into U(1) symmetric tensor networks (TNs) and leverage their applicability as quantum-inspired generative models to assist in the search of solutions to combinatorial optimization problems within the generator-enhanced optimization framework of Alcazar et al (2021 arXiv: 2101.06250 ). This allows us to exploit the generalization capabilities of TN generative models while constraining them so that they only output valid samples. Our constrained TN generative model efficiently captures the constraints by reducing number of parameters and computational costs. We find that at tasks with constraints given by arbitrary equalities, symmetric matrix product states outperform their standard unconstrained counterparts at finding novel and better solutions to combinatorial optimization problems.
As the quantum computing community gravitates towards understanding the practical benefits of quantum computers, having a clear definition and evaluation scheme for assessing practical quantum advantage in the context of specific applications is paramount. Generative modeling, for example, is a widely accepted natural use case for quantum computers, and yet has lacked a concrete approach for quantifying success of quantum models over classical ones. In this work, we construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Using the sample-based approach proposed here, any generative model, from state-of-the-art classical generative models such as generative adversarial networks (GANs) to quantum models such as quantum circuit born machines, can be evaluated under the same conditions on a concrete well-defined framework. In contrast to other sample-based metrics for probing practical generalization, we leverage constrained optimization problems (e.g., cardinality-constrained problems) and use these discrete datasets to define specific metrics capable of unambiguously measuring the quality of the samples and the model's generalization capabilities for generating data beyond the training set, but still within the valid solution space. Additionally, our metrics can diagnose trainability issues such as mode collapse and overfitting, as we illustrate when comparing GANs to quantum-inspired models built out of tensor networks. Our simulation results show that our quantum-inspired models have up to a 68 times enhancement in generating unseen unique and valid samples compared to the GANs explored here, and a ratio of 61:2 for generating samples with better quality than those observed in the training set. We foresee these metrics as valuable tools for rigorously defining practical quantum advantage in the domain of generative modeling, where finding a winning model remains an ongoing challenge as new architectures are developed.
This study explores quantum-inspired optimization algorithms (QIOAs) as practical tools for solving constrained combinatorial problems on classical machines. We analyze tasks that can be formulated in Ising or QUBO forms and benchmark three representative approaches: Simulated Bifurcation (SB), Quantum-Inspired Particle Swarm Optimization (QPSO), and a tensor-network (TN) method. A unified evaluation protocol is introduced that captures solution quality, feasibility, runtime, energy consumption, parameter sensitivity, and scalability. To ensure reliable performance, we develop automated penalty-adjustment and schedule-calibration strategies. Experimental results across diverse benchmarks show that SB and TN together yield the best trade-offs between accuracy and runtime: SB is efficient on dense instances with moderate penalties and low energy use, while TN is advantageous for sparse or modular networks, especially on GPUs. QPSO is competitive in smoother landscapes but more sensitive to hyperparameters. By linking performance to structural properties such as spectral gaps and constraint activity, we provide guidance for selecting suitable algorithms. Overall, QIOAs emerge as effective intermediaries between existing classical heuristics and emerging quantum devices, supported by a reproducible, energy-aware evaluation framework.
Model-based optimization, in concert with conventional black-box methods, can quickly solve large-scale combinatorial problems. Recently, quantum-inspired modeling schemes based on tensor networks have been developed which have the potential to better identify and represent correlations in datasets. Here, we use a quantum-inspired model-based optimization method TN-GEO to assess the efficacy of these quantum-inspired methods when applied to realistic problems. In this case, the problem of interest is the optimization of a realistic assembly line based on BMW's currently utilized manufacturing schedule. Through a comparison of optimization techniques, we found that quantum-inspired model-based optimization, when combined with conventional black-box methods, can find lower-cost solutions in certain contexts.
Quantum computers are expected to enable fast solving of large-scale combinatorial optimization problems. However, their limitations in fidelity and the number of qubits prevent them from handling real-world problems. Recently, a quantum-inspired solver using tensor networks has been proposed, which works on classical computers. Particularly, tensor networks have been applied to constrained combinatorial optimization problems for practical applications. By preparing a specific tensor network to sample states that satisfy constraints, feasible solutions can be searched for without the method of penalty functions. Previous studies have been based on profound physics, such as U(1) gauge schemes and high-dimensional lattice models. In this study, we devise to design feasible tensor networks using elementary mathematics without such a specific knowledge. One approach is to construct tensor networks with nilpotent-matrix manipulation. The second is to algebraically determine tensor parameters. We showed mathematically that such feasible tensor networks can be constructed to accommodate various types of constraints. For the principle verification, we numerically constructed a feasible tensor network for facility location problem, to find much faster construction than conventional methods. Then, by performing imaginary time evolution, feasible solutions were always obtained, ultimately leading to the optimal solution.