Pith. sign in

REVIEW 2 cited by

The curse of random quantum data

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.09937 v1 pith:F5OISOSI submitted 2024-08-19 quant-ph cs.LG

classification quant-phcs.LG
keywords quantumdatalearningmachinerandomcursedevicesgeneralization
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Quantum machine learning, which involves running machine learning algorithms on quantum devices, may be one of the most significant flagship applications for these devices. Unlike its classical counterparts, the role of data in quantum machine learning has not been fully understood. In this work, we quantify the performances of quantum machine learning in the landscape of quantum data. Provided that the encoding of quantum data is sufficiently random, the performance, we find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in the number of qubits, which we call "the curse of random quantum data". Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks. Conversely, we highlight that through meticulous design of quantum datasets, it is possible to avoid these curses, thereby achieving efficient convergence and robust generalization. Our conclusions are corroborated by extensive numerical simulations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Stochastic Pauli-path simulator for large-scale quantum optimization

    quant-ph 2026-07 conditional novelty 7.0 of 10

    A stochastic Pauli-path simulator with importance reweighting and path automatic differentiation produces unbiased gradient estimates for quantum optimization, demonstrated on VQE at 100 qubits and QNN at 40 qubits.

  2. Quantum Machine Learning: A Hands-on Tutorial for Machine Learning Practitioners and Researchers

    quant-ph 2025-02 unverdicted novelty 2.0 of 10

    A structured tutorial that introduces quantum machine learning concepts, algorithms, theory, and PennyLane code to classical ML practitioners.

Pith tools