REVIEW 5 cited by
Data re-uploading for a universal quantum classifier
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
A single qubit provides sufficient computational capabilities to construct a universal quantum classifier when assisted with a classical subroutine. This fact may be surprising since a single qubit only offers a simple superposition of two states and single-qubit gates only make a rotation in the Bloch sphere. The key ingredient to circumvent these limitations is to allow for multiple data re-uploading. A quantum circuit can then be organized as a series of data re-uploading and single-qubit processing units. Furthermore, both data re-uploading and measurements can accommodate multiple dimensions in the input and several categories in the output, to conform to a universal quantum classifier. The extension of this idea to several qubits enhances the efficiency of the strategy as entanglement expands the superpositions carried along with the classification. Extensive benchmarking on different examples of the single- and multi-qubit quantum classifier validates its ability to describe and classify complex data.
Forward citations
Cited by 5 Pith papers
-
When cheap gradients fail: the measurement cost of attacking quantum classifiers
Unbiased gradient extraction for attacking quantum classifiers costs at least Θ(d^{5/2}) shots under norm-concentration scaling, and ~d³ for tested deep circuits, so the attacker's relative cost diverges versus classi...
-
DAGAF: A directed acyclic generative adversarial framework for joint structure learning and tabular data synthesis
A data-agnostic circuit harmonic matrix C factorises Fourier-coefficient statistics and quantum neural tangent kernels for a broad class of re-uploading parametrised quantum circuits.
-
Quantum entanglement provides a competitive advantage in adversarial games
Entangled 8-qubit PQC feature extractors in PPO agents for Pong consistently beat separable PQCs of similar size and can match or exceed small classical MLPs in the low-parameter regime.
-
Old Rules in a New Game: Mapping Uncertainty Quantification to Quantum Machine Learning
Classical uncertainty quantification methods transfer to quantum machine learning; Bayesian quantum models and Gaussian dropout give the best-calibrated uncertainty estimates in small simulated experiments.
-
Out of Tune: Demystifying Noise-Effects on Quantum Fourier Models
Noise, especially decoherent gate errors, systematically reduces Fourier coefficient magnitudes, expressibility, and entangling capability of quantum Fourier models, with circuit architecture and encoding modulating t...
Discussion (0). Continue with ORCID to comment.