Speaker
Description
Quantum Decoding Algorithms (QDA) provide a new framework for solving combinatorial optimization problems by combining ideas from coding theory with quantum interference and quantum Fourier transform. The central algorithm within this framework is Decoded Quantum Interferometry (DQI), which reformulates optimization problems such as max-LINSAT through algebraic encodings that enable quantum interference to identify high-quality solutions. Recent theoretical evidence suggests that, for the Optimal Polynomial Intersection (OPI) problem, DQI may achieve superpolynomial quantum speedups over the best known classical approximation algorithms.
This presentation introduces the mathematical foundations underlying QDA, including the necessary concepts from finite fields, coding theory, and optimization, before presenting the DQI and its operating principles in a unified framework. The talk is intended to provide an accessible entry point for researchers interested in quantum optimization while highlighting the broader algorithmic ideas that distinguish QDA from conventional quantum optimization approaches. We conclude by discussing current evidence for quantum advantage, open theoretical questions, and future directions for the development of decoding-based quantum algorithms.
| Topic | Hybrid quantum-classical approaches for learning and optimization |
|---|---|
| Additional Topic | Theoretical foundations of quantum learning |