arXiv Machine Learning
Jul 3
Optimal Stabilizer Testing and Learning with Limited Quantum Memory
arXiv:2607. 02444v1 Announce Type: cross Abstract: We study stabilizer state testing and learning with limited coherent quantum memory.
Optimal Stabilizer Testing and Learning with Limited Quantum Memory
We study stabilizer state testing and learning with limited coherent quantum memory. Here an algorithm sequentially receives copies of an unknown $n$-qubit state, but may keep only $k$ qubits of coherent quantum memory between measurements.
Related stories
arXiv Machine Learning
Aug 26
Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
arXiv:2510.06848v3 Announce Type: replace-cross Abstract: Bell sampling is a simple yet powerful tool based on measuring two copies of a quantum state in the Bell basis, and has found applications in...
arXiv Machine Learning
1d ago
Sequential Capacity of Quantum Processes with Finite Memory
arXiv:2610. 02068v1 Announce Type: cross Abstract: How complex can the responses of a quantum device become as it runs longer with a fixed internal memory?
arXiv Statistics ML
3d ago
Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries
The paper investigates whether having only forward access to a state-preparation unitary—without its inverse—can reduce the number of queries needed for quantum PAC learning. By analyzing worst-case scenarios over all compatible unitaries and finite dimensions, the authors prove that the optimal forward-only query complexities for realizable and agnostic learning are θ((d+log(1/δ))/ε) and θ((d+log(1/δ))/ε²), respectively, matching classical and quantum-copy bounds. These results demonstrate that forward-only access offers no asymptotic advantage over classical data or quantum copies, highlighting the essential role of inverse access for any improvement in the realizable setting.
arXiv Machine Learning
Jun 11
Quantum Occam Learning: Sample-Supported Expressibility for Circuit-Based Quantum Learning
arXiv:2606. 12211v1 Announce Type: cross Abstract: A central principle in quantum machine learning is that an ansatz should be expressive enough to represent the quantum data of interest.
arXiv Machine Learning
Sep 18
Interactive proofs for verifying (quantum) learning and testing
The paper investigates whether a learner or tester with limited resources can improve performance by interacting with an untrusted, resource‑unconstrained party. It shows that for many scenarios, classical interaction offers no advantage, especially for memory‑constrained quantum algorithms. However, when quantum communication is permitted, interactive proof protocols enable memory‑constrained quantum verifiers to achieve significant gains through delegation.
arXiv Machine Learning
Jun 19
Quantum ring all-reduce: communication and privacy advantages for distributed learning
arXiv:2606. 20344v1 Announce Type: cross Abstract: Machine learning models have scaled to unprecedented sizes, making training across distributed devices the de facto standard in the field.
arXiv Machine Learning
Jun 3
Coherent Swap Regret and Channel-Proof Learning
arXiv:2606. 02655v1 Announce Type: cross Abstract: External regret certifies stability only against replacing one's behavior by a fixed alternative.
Hugging Face Trending Papers
Jul 7
Provable learning separation for predicting time-evolution of quantum many-body systems
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? We address this problem by studying the learnability of quantum many-body dynamics from the perspective of probably approximately correct (PAC)-learning.
arXiv Machine Learning
2d ago
Average-and Last-Iterate Lower Bounds for Optimistic Matrix Mirror-Prox in Quantum Zero-Sum Games
arXiv:2609.38835v1 Announce Type: cross Abstract: Optimistic matrix mirror-prox (OMMP) computes $\epsilon$-approximate Nash equilibria in quantum zero-sum games with an $O(1/\varepsilon)$ average-ite...
arXiv Machine Learning
Jun 8
Privacy Implies Stability: Information-Theoretic Generalization Bounds for Quantum Learning
arXiv:2602. 01177v3 Announce Type: replace-cross Abstract: We develop an information-theoretic framework connecting stability, privacy, and generalization for quantum learning algorithms.
arXiv Machine Learning
Sep 10
Tight Lower Bounds for State Tomography with Limited Entanglement
arXiv:2609.05718v1 Announce Type: cross Abstract: We study state tomography when each measurement acts on at most $k$ fresh copies and no quantum memory is retained between blocks. We prove a lower b...