REVIEW 3 cited by
Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance
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
Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance
read the original abstract
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML). At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation. Canonically, a QP features $N$ input qubits and one output qubit, and is used to determine whether an input state belongs to a specific class. Rydberg atoms, with their extended coherence times and scalable spatial configurations, provide an ideal platform for implementing QPs. In this work, we explore the implementation of QPs on Rydberg atom arrays, assessing their performance in tasks such as phase classification between Z2, Z3, Z4 and disordered phases, achieving high accuracy, including in the presence of noise. We also perform multi-class entanglement classification by extending the QP model to include multiple output qubits, achieving 95\% accuracy in distinguishing noisy, high-fidelity states based on separability. Additionally, we discuss the experimental realization of QPs on Rydberg platforms using both single-species and dual-species arrays, and examine the error bounds associated with approximating continuous functions.
Forward citations
Cited by 3 Pith papers
-
Quantitative Universal Approximation for Noisy Quantum Neural Networks
A quantitative universal approximation theorem with error bounds is established for noisy quantum neural networks applied to expectation targets in finance.
-
Quantitative Universal Approximation for Noisy Quantum Neural Networks
Provides a quantitative universal approximation theorem with error bounds for noisy quantum neural networks and tests on real hardware for quantitative finance.
-
Harnessing Quantum Dynamics for Robust and Scalable Quantum Extreme Learning Machines
TDVP-MPS simulations of Rydberg atom chains mitigate exponential concentration in QELM, yielding competitive MNIST accuracy via controlled entanglement and disorder without requiring exact quantum dynamics.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.