REVIEW 1 cited by
Exponential data encoding for quantum supervised learning
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
read the original abstract
Reliable quantum supervised learning of a multivariate function mapping depends on the expressivity of the corresponding quantum circuit and measurement resources. We introduce exponential-data-encoding strategies that are hardware-efficient and optimal amongst all non-entangling Pauli-encoded schemes, which is sufficient for a quantum circuit to express general functions having very broad Fourier frequency spectra using only exponentially few encoding gates. We show that such an encoding strategy not only reduces the quantum resources, but also exhibits practical resource advantage during training in contrast with known efficient classical strategies when polynomial-depth training circuits are also employed. When computation resources are constrained, we numerically demonstrate that even exponential-data-encoding circuits with single-layer training modules can generally express functions that lie outside the classically-expressible region, thereby supporting the practical benefits of such a resource advantage. Finally, we illustrate the performance of exponential encoding in learning the potential-energy surface of the ethanol molecule and California's housing prices
Forward citations
Cited by 1 Pith paper
-
How Hard Is Quantum Advantage? A Cloud Microphysics Stress Test for Variational Quantum Models
Even after rich frequency encoding, classical post-processing, and extensive hyperparameter search, hybrid QNNs underperform simple FCNNs on cloud microphysics parameterization.
Discussion (0). Continue with ORCID to comment.