arXiv:2608. 01194v1 Announce Type: cross Abstract: Artificial intelligence has been transformed by deep neural networks, yet the search for new learning architectures continues.
arXiv:2606. 14822v1 Announce Type: cross Abstract: Recent advances in Machine Learning have transformed numerous industrial sectors, yet classical paradigms face fundamental limitations: rapidly growing data volumes, rising computational costs, significant energy consumption, and the physical scaling limits of conventional hardware architectures.
arXiv:2607. 00365v1 Announce Type: cross Abstract: Artificial intelligence (AI) and quantum information (QI) are rapidly co-evolving.
The paper introduces a classical algorithm that dequantizes a quantum sampler used for learning with optimized random features. By sampling heavy indices and reducing the transformation to a small principal block, the method produces a sparse classical representation with operator‑norm guarantees. This approach enables a classical sampler with specified accuracy and polynomial runtime, demonstrating that quantum block‑encoding factorizations can provide sufficient classical structure even when direct sampling access to the composite matrix is unavailable.
arXiv:2607. 01329v1 Announce Type: cross Abstract: The geometric and topological structure of quantum cost landscapes (QCLs) governs the optimization and thus the predictive power of variational quantum algorithms (VQAs).
arXiv:2606. 31536v1 Announce Type: new Abstract: As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory.
The paper demonstrates that a small quantum computer of polylogarithmic size can achieve large‑scale classification and dimension reduction on massive classical data, while any classical machine achieving the same performance would need exponentially larger size. It shows that classical machines even if exponentially larger still require superpolynomially more samples and time. The authors provide evidence from real‑world applications such as single‑cell RNA sequencing and movie review sentiment analysis, achieving four to six orders of magnitude reduction in size with fewer than 60 logical qubits.
arXiv:2510. 03389v2 Announce Type: replace-cross Abstract: Current quantum computers require algorithms that use limited resources economically.
arXiv:2606. 26312v1 Announce Type: cross Abstract: Autoencoders transformed classical machine learning by solving the curse of dimensionality, enabling principled weight initialization and learning compact, structured representations.
arXiv:2606. 01291v1 Announce Type: cross Abstract: Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations: classical statevector simulation memory scales exponentially ($\mathcal{O}(2^n)$), and global cost functions suffer from barren plateaus where gradient variance decays exponentially ($\mathcal{O}(1/2^n)$).
arXiv:2607. 07754v1 Announce Type: new Abstract: Pattern recognition problems arise in a variety of physical image processing situations, and convolutional neural networks are a popular scheme for the required feature extraction and classification tasks.
arXiv:2607. 06472v1 Announce Type: cross Abstract: Given that quantum computers are naturally suited to simulate the behavior of quantum many-body systems, an immediate question arises: can one formulate physically motivated quantum machine learning (QML) tasks that exhibit learning separations?