quant-ph · 2026-11-16 · No. 173
Quantum Physics, 2026-11-16.
2 new papers in quant-ph. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
2 entries-
01
Agentic AI for Discovering Fault-Tolerant Quantum Circuits
Aritra Lahiri, Florian Marquardt
quant-ph · cs.AI
Scaling quantum computing toward practical quantum advantage is currently limited by the efficiency of circuits that operate on information encoded by quantum error-correcting codes. The full stack of quantum computing encompasses several tasks: preparation of logical code states, implementation of logical gates, logical routines on encoded qubits, etc. Yet, these circuits are largely designed by hand for individual cases, with some recent...
-
02
Structure makes quantum circuits trainable
Wenbo Xie, Wojciech Szpankowski, Ananth Grama
quant-ph · cs.LG
The scalability of variational quantum algorithms is limited by barren plateaus, where gradients vanish exponentially in system size. This worst-case result raises fundamental questions about the trainability of quantum AI models. We present a major advance towards resolving this trainability question by answering whether a given quantum circuit has a barren plateau. We do this using an analytical framework that bounds the gradient variance...
This edition is part of The Daily Abstract — quant-ph archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.