New quantum algorithm accelerates complex optimization problems

Researchers Daniel Stilck França and Ngoc Hoang Anh Mai have developed a new quantum algorithm that speeds up Lasserre relaxations. Their method offers a significant advantage over classical approaches for certain types of optimization problems. The breakthrough could change how complex calculations in fields like finance are handled. The team focused on improving the efficiency of semidefinite programs, a key part of Lasserre’s hierarchy. By using block encoding, they enabled quantum computers to process large matrices more effectively. This technique reduces the computational effort needed for probabilistic optimization tasks.

Their algorithm achieves a super-quadratic speedup for specific polynomial optimization problems. It works best when solutions fall within a defined range or a simplex. The researchers also applied matrix multiplicative weights within a quantum framework to enhance performance. To handle constrained problems, they extended block encoding with a block-diagonal matrix and a linear combination of unitaries. Testing the algorithm on portfolio optimization, they found it outperformed classical bounds. The results highlight the potential of quantum methods in solving real-world optimization challenges.

The new quantum algorithm provides a faster way to approximate solutions in semidefinite programs. Its success in portfolio optimization suggests broader applications in finance and operations research. The work marks a step forward in using quantum computation for large-scale mathematical problems.