Recognition: unknown
Quantum algorithms for supervised and unsupervised machine learning
read the original abstract
Machine-learning tasks frequently involve problems of manipulating and classifying large numbers of vectors in high-dimensional spaces. Classical algorithms for solving such problems typically take time polynomial in the number of vectors and the dimension of the space. Quantum computers are good at manipulating high-dimensional vectors in large tensor product spaces. This paper provides supervised and unsupervised quantum machine learning algorithms for cluster assignment and cluster finding. Quantum machine learning can take time logarithmic in both the number of vectors and their dimension, an exponential speed-up over classical algorithms.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
QLAM: A Quantum Long-Attention Memory Approach to Long-Sequence Token Modeling
QLAM extends state-space models with quantum superposition in the hidden state for linear-time long-sequence modeling and reports consistent gains over RNN and transformer baselines on sequential image tasks.
-
Physics inspired quantum algorithm for QCD splitting functions
A modular two-qubit quantum circuit is constructed to encode the concurrence of helicity entanglement in pure-gluon splitting, with parameters calibrated to LHC jet data so that composed circuits reproduce experimenta...
-
Bridge the Gap between Classical and Quantum Neural Networks with Residual Connections
HQRN creates an exact functional match to classical residual networks on basis inputs while using quantum correlations for better performance on mixed states in digit recognition and entanglement classification.
-
Divide et impera: hybrid multinomial classifiers from quantum binary models
Binary decision trees enable cost-effective multinomial classifiers from quantum binary models, matching other methods' accuracy with at most logarithmic overhead in the number of classes.
-
Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation
Hybrid algorithm classically diagonalizes Hamiltonian tensor factors to construct block-encodings for quantum simulation via QSVD, with extensions for commuting time-dependent cases.
-
PINNACLE: An Open-Source Computational Framework for Classical and Quantum PINNs
PINNACLE is an open-source framework for classical and quantum PINNs that supplies modular training methods and benchmarks showing high sensitivity to architecture choices plus parameter-efficiency gains in some hybri...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.