The advent of quantum algorithms has initiated a discourse on the potential for quantum speedups for optimization problems. However, several factors still hinder a practical realization of the potential benefits. These include the lack of advanced, error-free quantum hardware, the absence of accessible software stacks for seamless integration and interaction, and the lack of methods that allow us to leverage the theoretical advantages to real-world use cases. This paper works towards the creation of an accessible hybrid software stack for solving optimization problems, aiming to create a fundamental platform that can utilize quantum technologies to enhance the solving process. We introduce a novel approach that we call Hybrid Meta-Solving, which combines classical and quantum optimization techniques to create customizable and extensible hybrid solvers. We decompose mathematical problems into multiple sub-problems that can be solved by classical or quantum solvers, and propose techniques to semi-automatically build the best solver for a given problem. Implemented in our ProvideQ toolbox prototype, Meta-Solving provides interactive workflows for accessing quantum computing capabilities. Our evaluation demonstrates the applicability of Meta-Solving in industrial use cases. It shows that we can reuse state-of-the-art classical algorithms and extend them with quantum computing techniques. Our approach is designed to be at least as efficient as state-of-the-art classical techniques, while having the potential to outperform them if future advances in the quantum domain are made.
Distributed quantum-classical hybrid algorithm for solving K-SAT problem
School of Computer Science and Engineering, Sun Yat-sen University(中山大学计算机学院);The Guangdong Key Laboratory of Information Security Technology, Sun Yat-sen University(中山大学广东省信息安全技术重点实验室);Shenzhen Research Institute of Sun Yat-Sen University(中山大学深圳研究院);School of Physics and Astronomy, Sun Yat-sen University(中山大学物理与天文学院);Departamento de Matemática, Instituto Superior Técnico, Instituto de Telecomunicações(里斯本高等理工学院数学系,电信研究所)
Solving Constrained Optimization Problems Using Hybrid Qubit-Qumode Quantum Devices
Yale University(耶鲁大学);Massachusetts Institute of Technology(麻省理工学院);University of Connecticut(康涅狄格大学);RTX Technology Research Center(RTX技术研究中心);University of Massachusetts-Amherst(马萨诸塞大学阿默斯特分校)
Quantum-Classical Hybrid Algorithm for Solving the Learning-With-Errors Problem on NISQ Devices
Beijing Academy of Quantum Information Sciences(北京量子信息科学研究院);State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics, Tsinghua University(清华大学物理系低维量子物理国家重点实验室);State Key Laboratory of Mathematical Engineering and Advanced Computing(数学工程与先进计算国家重点实验室);Division of Physics and Applied Physics, School of Physical and Mathematical Sciences, Nanyang Technological University(南洋理工大学物理与数学科学学院物理与应用物理系)
Solving Drone Routing Problems with Quantum Computing: A Hybrid Approach Combining Quantum Annealing and Gate-Based Paradigms
TECNALIA(泰克纳利亚技术研究中心);Basque Research and Technology Alliance (BRTA)(巴斯克研究与技术联盟);National Centre for Scientific Research “Demokritos”(德谟克利特国家科学研究中心);Fraunhofer Institute for Open Communication Systems (FOKUS)(弗劳恩霍夫开放通信系统研究所)