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

IEEE Nanotechnology Magazine

Quantum-Inspired Industrial Scheduling on Nanoscale Platforms

Chun‐Cheng Lin, Zhen-Yin Annie Chen, He-Yau Kang, Lun‐Ping Hung

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1109/mnano.2026.3728348

Related papers

QUBO-Based Scheduling of Heterogeneous Quantum Computing Resources in Scale-Free Industrial Networks

Yong Wang, Xiaoling Wang, Yu Pan +1 more

Youth Academic Annual Conference of Chinese Association of Automation (YAC)•May 1, 2026•0 citations

Quantum-Inspired Optimization for Modern Industrial Systems

Amolkumar Jadhav, Sheshikala Martha, Ajinkya Yadav +3 more

International Conference on Computational and Cognitive Systems Science•Jan 1, 2025•0 citations

A Reality Check on Quantum Optimisation: Evidence from an Industrial Case Study

Hila Safi, Karen Wintersperger, Oliver von Sicard +2 more

Quantum Processing Units promise speed-ups for selected computational problems, including combinatorial optimisation, but their industrial utility remains an open challenge. We study an industrial variant of the Job-Shop Scheduling Problem using quantum, quantum-inspired, and classical methods across three platforms: IBM Quantum, the D-Wave Quantum Annealer, and the Fujitsu Digital Annealer. By tailoring formulations to hardware-specific constraints, we show that hardware-software co-design is essential for solution quality and scalability. We benchmark all approaches against an exact classical solver and a MILP formulation, evaluating runtime, solution quality, and scalability. Our results indicate that quantum and quantum-inspired optimisation can support industrial solver selection, integration in classical workflows, modelling decisions, and early proof-of-concept development, while suggesting a potential path towards improved approximations for industrial scheduling.

cs.ARCross-listedarXiv:2607.13325•Jul 16, 2026•0 citations

Quantum Approximation for Multi-Scale Scheduling

Jaeho Choi, Seunghyeok Oh, Joongheon Kim

•Apr 24, 2020•0 citations

A Reality Check on Quantum Optimisation: Evidence from an Industrial Case Study

Hila Safi, Karen Wintersperger, Oliver von Sicard +2 more

Quantum Processing Units promise speed-ups for selected computationalproblems, including combinatorial optimisation, but their industrial utilityremains an open challenge. We study an industrial variant of the Job-ShopScheduling Problem using quantum, quantum-inspired, and classical methodsacross three platforms: IBM Quantum, the D-Wave Quantum Annealer, and theFujitsu Digital Annealer. By tailoring formulations to hardware-specificconstraints, we show that hardware-software co-design is essential for solutionquality and scalability. We benchmark all approaches against an exact classicalsolver and a MILP formulation, evaluating runtime, solution quality, andscalability. Our results indicate that quantum and quantum-inspired optimisationcan support industrial solver selection, integration in classicalworkflows, modelling decisions, and earlyproof-of-concept development, while suggesting a potential path towards improvedapproximations for industrial scheduling.

•Sep 19, 2026•0 citations

Quantum-Inspired Computing Approaches for Complex Optimization Problems in Industrial Engineering

Arjun Sen, Hiba Rashid, Nikhil Joshi

Industrial engineering increasingly depends on solving large-scale optimization problems involving scheduling, routing, resource allocation, inventory control, energy management, and supply-chain coordination. Classical exact methods often become computationally expensive when problem size, uncertainty, and combinatorial complexity grow rapidly. Although practical quantum computers are still developing, quantum-inspired computing approaches have emerged as powerful alternatives that adapt principles from quantum mechanics to run on classical hardware. This paper investigates quantum-inspired computing approaches for complex optimization problems in industrial engineering. It examines methodologies including simulated annealing, tensor-network optimization, Ising formulations, quantum- inspired evolutionary algorithms, digital annealers, and hybrid classical-intelligent heuristics. Applications in production scheduling, facility layout, vehicle routing, maintenance planning, portfolio optimization, warehouse operations, and smart manufacturing are analyzed. Particular attention is given to solution quality, scalability, stochastic decision-making, real-time adaptability, and integration with Industry 4.0 data systems. Benefits include faster near-optimal solutions, improved operational efficiency, reduced energy consumption, and better responsiveness under uncertainty. Major challenges include formulation difficulty, parameter tuning, benchmarking inconsistency, interpretability, and transition barriers within traditional industrial workflows. A future roadmap is proposed involving hybrid quantum-classical ecosystems, AI- guided optimization engines, digital twins, and autonomous decision platforms. The paper concludes that quantum-inspired computing can deliver practical industrial value today by bridging the gap between conventional optimization and future quantum advantage, especially in environments where speed, flexibility, and complexity management are essential.

VW Applied Sciences•Aug 12, 2019•0 citations
Quantum Processing Units promise speed-ups for selected computational problems, including combinatorial optimisation, but their industrial utility remains an open challenge. We study an industrial variant of the Job-Shop Scheduling Problem using quantum, quantum-inspired, and classical methods across three platforms: IBM Quantum, the D-Wave Quantum Annealer, and the Fujitsu Digital Annealer. By tailoring formulations to hardware-specific constraints, we show that hardware-software co-design is essential for solution quality and scalability. We benchmark all approaches against an exact classical solver and a MILP formulation, evaluating runtime, solution quality, and scalability. Our results indicate that quantum and quantum-inspired optimisation can support industrial solver selection, integration in classical workflows, modelling decisions, and early proof-of-concept development, while suggesting a potential path towards improved approximations for industrial scheduling.
Quantum Processing Units promise speed-ups for selected computationalproblems, including combinatorial optimisation, but their industrial utilityremains an open challenge. We study an industrial variant of the Job-ShopScheduling Problem using quantum, quantum-inspired, and classical methodsacross three platforms: IBM Quantum, the D-Wave Quantum Annealer, and theFujitsu Digital Annealer. By tailoring formulations to hardware-specificconstraints, we show that hardware-software co-design is essential for solutionquality and scalability. We benchmark all approaches against an exact classicalsolver and a MILP formulation, evaluating runtime, solution quality, andscalability. Our results indicate that quantum and quantum-inspired optimisationcan support industrial solver selection, integration in classicalworkflows, modelling decisions, and earlyproof-of-concept development, while suggesting a potential path towards improvedapproximations for industrial scheduling.
Industrial engineering increasingly depends on solving large-scale optimization problems involving scheduling, routing, resource allocation, inventory control, energy management, and supply-chain coordination. Classical exact methods often become computationally expensive when problem size, uncertainty, and combinatorial complexity grow rapidly. Although practical quantum computers are still developing, quantum-inspired computing approaches have emerged as powerful alternatives that adapt principles from quantum mechanics to run on classical hardware. This paper investigates quantum-inspired computing approaches for complex optimization problems in industrial engineering. It examines methodologies including simulated annealing, tensor-network optimization, Ising formulations, quantum- inspired evolutionary algorithms, digital annealers, and hybrid classical-intelligent heuristics. Applications in production scheduling, facility layout, vehicle routing, maintenance planning, portfolio optimization, warehouse operations, and smart manufacturing are analyzed. Particular attention is given to solution quality, scalability, stochastic decision-making, real-time adaptability, and integration with Industry 4.0 data systems. Benefits include faster near-optimal solutions, improved operational efficiency, reduced energy consumption, and better responsiveness under uncertainty. Major challenges include formulation difficulty, parameter tuning, benchmarking inconsistency, interpretability, and transition barriers within traditional industrial workflows. A future roadmap is proposed involving hybrid quantum-classical ecosystems, AI- guided optimization engines, digital twins, and autonomous decision platforms. The paper concludes that quantum-inspired computing can deliver practical industrial value today by bridging the gap between conventional optimization and future quantum advantage, especially in environments where speed, flexibility, and complexity management are essential.