mlsanityData to 14 Oct 2026

Cross-Backend QIEO: Universal Runtime Portability across OpenMP5, CUDA, HIP, and Multi-Language Interfaces

arXiv 2609.30914 ↗First posted 25 Sep 2026cs.DC cs.CL math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

Quantum-inspired algorithms emulate quantum mechanical principles, such as, superposition, interference, and probabilistic amplitude evolution, on classical hardware by representing candidate solutions as qubit vectors and evolving them through rotation-gate operators. This approach offers higher optimization performance without physical qubits, and has been shown to achieve order-of-magnitude speedups (10--80×) over traditional solvers on combinatorial, high-dimensional NP-hard problems. A critical barrier to adoption, however, is the lack of a unified execution framework that delivers both algorithmic performance and hardware portability. We present Cross-Backend Quantum Inspired Evolutionary Optimizer (QIEO), the runtime core of BQP's BQPhy solver, which addresses this gap through a single-source-of-truth architecture. One C++ implementation of the QIEO algorithm is compiled once per hardware target and exposed to multiple high-level languages via thin binding layers. The framework dispatches to CPU (sequential), OpenMP~5 (multi-core), CUDA (NVIDIA), and HIP (AMD) backends at runtime, adapting kernels to each device's memory hierarchy and warp/wavefront execution model. The framework's real-world utility is validated through binding demonstrations that share the identical C++ runtime. BQPhy's Python library is demonstrated on a neural network hyperparameter optimisation achieving 88.60% test accuracy on MNIST. BQPhy's MATLAB's Toolkit is tested on wind farm layout optimisation attaining 365,399 ± 4,552~MWh/yr, which is statistically indistinguishable from particle swarm optimisation and +7.6% above genetic algorithms on a 32-variable constrained engineering problem. The Julia package tackles the Lotka--Volterra parameter estimation where BQPhy replaces native Julia solvers on the same residual, cutting mean SSE by 2.1×.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 39 references that are in the map. First posted on arXiv 25 Sep 2026.

Builds on

5 of 39 references.

References · 5

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  3. 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 699
  4. 2018Tune: A Research Platform for Distributed Model Selection and Trainingcited by 395
  5. 2017Complex Networks from Classical to Quantumcited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Platform-Agnostic Modular Architecture for Quantum Benchmarking
  2. 2026Exploring the non-convexity in machine learning using quantum-inspired optimization
  3. 2026Hybrid LLM-Guided Search for Quantum Reservoir Architecture Design
  4. 2026Qiskit QuantumKatas: Adapting Microsoft's Quantum Computing exercises for LLM evaluation
  5. 2025TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search
  6. 2026Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning
  7. 2023Projected Stochastic Gradient Descent with Quantum Annealed Binary Gradients
  8. 2025QAgent: An LLM-based Multi-Agent System for Autonomous OpenQASM programming