דלג לתוכן (מקש קיצור 's')
אירועים

אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

אתחול בבסיס X ב-QAOA דחוס: מאנסמבלים אקראיים לבחירה מובנית
event speaker icon
עבד סמרי (הרצאה סמינריונית למגיסטר)
event date icon
יום ראשון, 29.11.2026, 14:00
event location icon
טאוב 401
event speaker icon
מנחה: פרופ' סטיבין פראנקל

The Quantum Approximate Optimization Algorithm (QAOA) offers a variational approach to combinatorial optimization. When combined with quantum random access code (QRAC) compression, the quality of classical solutions depends not only on the optimized quantum energy but also on the initial state and the decoding procedure.

In this seminar, we investigate SEMI-QAOA, a family of compressed QAOA algorithms initialized in tensor products of X-basis eigenstates, with corresponding state-dependent mixers. We first introduce Rand-SEMI-QAOA, which explores ensembles of randomly selected initialization masks, demonstrating substantial improvements in decoded MaxCut performance over conventional initialization.

We then investigate structured approaches that select a single initialization mask before variational angle optimization, reducing the need to optimize large ensembles of quantum circuits. We establish theoretical separations showing that conventional initialization can suffer from persistent decoding obstructions, while suitable X-basis masks overcome these limitations, even at shallow circuit depth.

Finally, we present numerical comparisons across combinatorial optimization problems, examining solution quality, computational requirements, and the relationship between quantum energy optimization and classical decoding performance. The results highlight initialization-mask selection as an important algorithmic component of compressed quantum optimization.