arXiv AI By Hyojun Ahn, Joongheon Kim

A Tutorial on Quantum Amplitude Embedding with Data Re-Uploading

Read the original on arXiv AI →

The paper presents a tutorial on enhancing quantum amplitude embedding through data re-uploading, a technique that repeatedly encodes input data between trainable blocks to increase model expressiveness. It demonstrates that each additional upload raises the reachable polynomial order by two and provides simulation results showing significant improvements in test coefficient of determination for higher-order targets. The study offers practical guidance on selecting the number of uploads based on the polynomial order required for a given task.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Jun 24

Quantum Adaptive Self-Attention for Quantum Transformer Models

arXiv:2504. 05336v4 Announce Type: replace-cross Abstract: A recurring weakness in quantum machine learning (QML) is that reported ``quantum advantages'' are seldom tested against a \emph{capacity-matched} classical control, leaving it unclear whether a gain comes from the quantum substrate or from the architectural change that accompanies it.

By Chi-Sheng Chen, En-Jui Kuo
arXiv Machine Learning
Oct 16

Same Spectrum, Harder First-Order Training: Phase-Locking in Single- versus Multi-Qubit Re-Uploading Circuits

The paper compares single‑qubit re‑uploading (serial) variational quantum circuits with multi‑qubit circuits that use the same encoding budget for one‑dimensional inputs. It shows that although a serial circuit can represent any function a multi‑qubit circuit can, its first‑order training is more costly because all parameters move the state along a single phase‑locking direction, limiting the number of effective tangent directions. Experiments demonstrate that for larger encoding budgets the serial circuit converges far less often than the multi‑qubit control, and its held‑out error can be up to 1.5 times higher under Adam optimization.

By Michael Poppel, David Bucher, Maximilian Zorn, Markus Baumann, Sebastian W\"olckert, Claudia Linnhoff-Popien, Philipp Altmann, Jonas Stein