Waseda University researchers develop a novel quantum algorithm for combinatorial optimization problems with constraints.

Waseda University researchers have developed a novel quantum algorithm, post-processing variationally scheduled quantum algorithm, to solve combinatorial optimization problems (COPs) with constraints within the operation time of quantum computers. By combining variational scheduling with post-processing, the algorithm achieves near-optimal solutions for COPs, applicable in fields such as logistics, supply chain management, machine learning, material design, and drug discovery.