This repository contains the complete experimental framework used in the research study:"ECHO: Eigenvalue-Guided Homotopy Optimization for QUBO with Application to Health Insurance Plan Design".The project implements a structured QUBO optimization model for regulated health insurance product design and evaluates several optimization methods including a newly introduced ECHO method (Eigenvalue-Guided Homotopy Optimization).The framework includes:• Implementation of the ECHO optimization algorithm• Baseline solvers including Greedy heuristic and Simulated Annealing• Optional exact optimization using the Gurobi solver• Synthetic actuarial data generation using a frequency–severity model• QUBO construction with regulatory and affordability constraints• Benchmark QUBO families including MaxCut, portfolio selection, and spectral-dense random QUBO instances• Full experiment pipelines reproducing the computational study reported in the manuscriptThe repository enables reproduction of the experiments reported in the paper, including the 520 structured insurance QUBO instances and additional benchmark experiments used to evaluate algorithmic generalization.The code is publicly available at:https://github.com/firaskhabour/echo-qubo-optimization
This repository contains the complete experimental framework used in the research study:"ECHO: Eigenvalue-Guided Homotopy Optimization for QUBO with Application to Health Insurance Plan Design".The project implements a structured QUBO optimization model for regulated health insurance product design and evaluates several optimization methods including a newly introduced ECHO method (Eigenvalue-Guided Homotopy Optimization).The framework includes:• Implementation of the ECHO optimization algorithm• Baseline solvers including Greedy heuristic and Simulated Annealing• Optional exact optimization using the Gurobi solver• Synthetic actuarial data generation using a frequency–severity model• QUBO construction with regulatory and affordability constraints• Benchmark QUBO families including MaxCut, portfolio selection, and spectral-dense random QUBO instances• Full experiment pipelines reproducing the computational study reported in the manuscriptThe repository enables reproduction of the experiments reported in the paper, including the 520 structured insurance QUBO instances and additional benchmark experiments used to evaluate algorithmic generalization.The code is publicly available at:https://github.com/firaskhabour/echo-qubo-optimization
Quantum Optimization Pipeline for the Capacitated Vehicle Routing Problem (CVRP) This repository presents a research-oriented implementation of classical and quantum optimization techniques for solving the Capacitated Vehicle Routing Problem (CVRP). The project serves as an educational and experimental framework for studying hybrid quantum-classical optimization methods and benchmarking their performance on combinatorial optimization problems. The implementation includes: Classical CVRP optimization using Google OR-Tools Mathematical formulation of the routing problem Transformation of the optimization problem into a Quadratic Unconstrained Binary Optimization (QUBO) model Conversion of the QUBO formulation into an Ising Hamiltonian Implementation of the Quantum Approximate Optimization Algorithm (QAOA) using Qiskit Classical versus quantum performance comparison Route visualization and benchmarking Modular Python code designed for experimentation and future extensions The project is intended as a foundation for exploring applications of Quantum Computing, Operations Research, and Hybrid Quantum-Classical Optimization in real-world routing and logistics problems. It provides a reproducible environment for understanding optimization workflows, evaluating quantum algorithms, and extending the framework toward more complex scenarios such as dynamic vehicle routing and emergency ambulance dispatch. Keywords: Quantum Computing, Quantum Optimization, QAOA, QUBO, Ising Model, Capacitated Vehicle Routing Problem (CVRP), Operations Research, OR-Tools, Qiskit, Combinatorial Optimization, Hybrid Quantum-Classical Algorithms. This software was developed as part of a research internship focused on quantum optimization and serves as a learning and experimentation platform for future research.
Quadratic Unconstrained Binary Optimization (QUBO) is a central formulation for combinatorial optimization and has gained increasing attention due to its compatibility with quantum, hybrid quantum-classical, and quantum-inspired solvers. However, translating natural-language problem descriptions into correct QUBO formulations remains difficult, requiring the identification of binary variables, constraints, objective functions, penalty terms, and suitable penalty weights. This process is time-consuming and often demands substantial domain expertise. To address this challenge, we propose an end-to-end multi-agent framework that automatically generates QUBO formulations from natural-language problem descriptions, supported by structured or unstructured test cases. To evaluate its performance, We also introduce QUBOBench, a benchmark containing 100 combinatorial optimization problems across 12 application domains, curated from peer-reviewed literature, competitions, and canonical NP-hard problems. Experimental results show that our framework achieves 68% accuracy on QUBOBench, outperforming a direct single-call baseline by 22%. Further analysis identifies iterative self-repair as the most important component contributing to improved performance. The data and code are open-sourced at https://quitttcat.github.io/QuantumQUBOAgent.
Quadratic Unconstrained Binary Optimization (QUBO) provides a versatile framework for representing NP-hard combinatorial problems, yet existing solvers often face trade-offs among speed, accuracy, and scalability. In this work, we introduce a quantum-inspired solver (QIS) that unites branch-and-bound pruning, continuous gradient-descent refinement, and quantum-inspired heuristics within a fully adaptive control architecture. We benchmark QIS3 against eight state-of-the-art solvers, including genetic algorithms, coherent Ising machines, simulated bifurcation, parallel tempering, simulated annealing, our prior QIS2 version, D-Wave's simulated-annealing (Neal), and Gurobi on three canonical QUBO problem classes: Max-Cut, NAE-3SAT, and Sherrington-Kirkpatrick spin glass problems. Under a uniform runtime budget, QIS3 attains the best solution on nearly all instances, achieving optimality in 94% of max-cut instances. These results establish QIS3 as a robust, high-performance solver that bridges classical exact strategies and quantum-inspired heuristics for scalable QUBO optimization.
With the applications of quantum computing becoming more and more widespread, finding ways that allow end users without experience in the field to apply quantum computers to solve their individual problems is becoming a crucial task. However, current optimization algorithms require problem instances to be posed in complex formats that are challenging to formulate, even for experts. In particular, the Quadratic Unconstrained Binary Optimization (QUBO) formalism employed by many quantum optimization algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA), involves the mathematical rewriting of constraints under strict conditions. To facilitate this process, we propose a framework to automatically generate QUBO formulations for pathfinding problems. This framework allows users to translate their specific problem instances into formulations that can be passed directly to quantum algorithms for optimization without requiring any expertise in the field of quantum computing. It supports three different encoding schemes that can easily be compared without requiring manual reformulation efforts. The resulting QUBO formulations are robust and efficient, reducing the previously tedious and error-prone reformulation process to a task that can be completed in a matter of seconds. In addition to an open-source Python package available on https://github.com/munich-quantum-toolkit/problemsolver, we also provide a graphical user interface accessible through the web (https://munich-quantum-toolkit.github.io/problemsolver/), which can be used to operate the framework without requiring the end user to write any code.
This paper, “Quantum Echoes and Harmonic Continuity: A Meta-Proof Recursive Loop,” introduces a self-referential framework that demonstrates quantum-harmonic principles through its own structure. Each section, equation, and diagram acts as a harmonic mode within the document, encoding continuity and curvature analogous to the Unified Harmonic Framework (UHF). The recursive loop validates concepts such as quantum echoes, teleportation, and substrate harmonicity by embedding them into the paper’s form, making the document both exposition and proof. Falsifiability is inherent: any logical inconsistency breaks the recursive coherence, providing a testable criterion. This work bridges theoretical physics, meta-logic, and structural verification, offering implications for quantum gravity, AI reasoning models, and harmonic information systems.
This paper presents a comprehensive framework for integrating Quantum Machine situating the problem: rising healthcare costs and the increasing complexity of health-claims data demand more powerful predictive models than standard generalized linear models (GLMs) alone can reliably deliver. We review classical actuarial techniques and contemporary Learning (QML) into actuarial prediction pipelines for health insurance. We begin by machine learning (ML) practices in healthcare-cost and claims prediction and summarize the current state of quantum computing and QML with special attention to algorithms and methods applicable in the near-term (NISQ) era. We then introduce a hybrid quantum–classical actuarial pipeline (HQCAP) that maps actuarial targets (claim frequency, severity, high-cost utilizers, readmission risk) to QML model families (quantum kernel methods, variational quantum circuits, and quantum-enhanced optimization), together with detailed data-encoding strategies, loss functions and calibration techniques appropriate for insurance. We present an experimental plan (datasets, baselines, metrics) for evaluating HQCAP on representative healthcare cost and claims problems (using MEPS/MIMIC public datasets and synthetic insurance-claims data), and discuss implementation considerations (noise, qubit counts, simulators, software stacks), regulatory and auditability constraints, interpretability and fairness, and an economic analysis of when QML could be preferable to classical approaches. We close with limitations, open research directions, and practical recommendations for actuaries and insurers exploring QML today. Key contributions: (1) a detailed, implementable hybrid QML/actuarial workflow; (2) explicit mapping between actuarial targets and QML primitives; and (3) reproducible experimental protocols for academic and industry evaluation.