Quantum algorithm theory fails for shallow circuits, study finds

A new research paper challenges existing theories on variational quantum algorithms (VQAs), specifically the Quantum Approximate Optimization Algorithm (QAOA) when applied to the maximum independent set problem. The study found that dynamical Lie algebraic (DLA) theory's predictions of vanishing loss and gradient variances do not hold true for shallow circuits. Instead, the research identified common "cragged terrains" where variances polynomially increase with system size, contradicting DLA predictions. Empirical hardness models were developed to predict instance-wise difficulty, showing high fidelity in identifying landscape scaling classes despite poor generalization. AI

RANK_REASON Research paper published on arXiv detailing theoretical and empirical findings about quantum algorithms. [lever_c_demoted from research: ic=1 ai=0.1]

Read on arXiv cs.LG →

• Anžej Margeta-Cacace
• arXiv
• Dynamical Lie Algebras
• Hugging Face
• maximum independent set
• QAOA
• Quantum Approximate Optimization Algorithm

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →