Quantum machine learning: a classical perspective
From MaRDI portal
Abstract: Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning techniques to impressive results in regression, classification, data-generation and reinforcement learning tasks. Despite these successes, the proximity to the physical limits of chip fabrication alongside the increasing size of datasets are motivating a growing number of researchers to explore the possibility of harnessing the power of quantum computation to speed-up classical machine learning algorithms. Here we review the literature in quantum machine learning and discuss perspectives for a mixed readership of classical machine learning and quantum computation experts. Particular emphasis will be placed on clarifying the limitations of quantum algorithms, how they compare with their best classical counterparts and why quantum resources are expected to provide advantages for learning problems. Learning in the presence of noise and certain computationally hard problems in machine learning are identified as promising directions for the field. Practical questions, like how to upload classical data into quantum form, will also be addressed.
Recommendations
Cites work
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 5485455 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1866308 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- 10.1162/153244303321897681
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A faster strongly polynomial time algorithm for submodular function minimization
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- A theory of the learnable
- Adaptive Rejection Sampling for Gibbs Sampling
- Adversarial perturbations of deep neural networks
- An improved lower bound on query complexity for quantum PAC learning
- Approximation by superpositions of a sigmoidal function
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Coins make quantum walks faster
- Complexity classifications of Boolean constraint satisfaction problems
- Computational Complexity
- Cryptographic limitations on learning Boolean formulae and finite automata
- Equivalences and Separations Between Quantum and Classical Learnability
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- Fast Parallel Matrix Inversion Algorithms
- Fast monte-carlo algorithms for finding low-rank approximations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Gaussian processes for machine learning.
- Improved bounds on quantum learning algorithms
- Learning DNF in time
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Learning the kernel matrix with semidefinite programming
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Machine learning. A probabilistic perspective
- Markov random fields and their applications
- Matrix multiplication via arithmetic progressions
- Maximum margin algorithms with Boolean kernels
- Most tensor problems are NP-hard
- On regularization algorithms in learning theory
- On the inherent intractability of certain coding problems (Corresp.)
- On the mathematical foundations of learning
- On the robustness of bucket brigade quantum RAM
- On the role of entanglement in quantum-computational speed-up
- Optimal quantum sample complexity of learning algorithms
- Optimal rates for the regularized least-squares algorithm
- Pattern recognition and machine learning.
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Quantum Algorithms for Some Hidden Shift Problems
- Quantum Complexity Theory
- Quantum algorithm for preparing thermal Gibbs states -- detailed analysis
- Quantum computation and quantum information. 10th anniversary edition
- Quantum random access memory
- Quantum recommendation systems
- Queries and concept learning
- Search via Quantum Walk
- Semidefinite Programming
- Sequential Monte Carlo Methods in Practice
- Sequential Monte Carlo Samplers
- Skepticism of quantum computing
- Smoothed analysis of algorithms
- Some optimal inapproximability results
- Strengths and Weaknesses of Quantum Computing
- Tensor Decompositions and Applications
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- The computational complexity of probabilistic inference using Bayesian belief networks
- The quantum adiabatic optimization algorithm and local minima
- The quest for a quantum neural network
- Training Products of Experts by Minimizing Contrastive Divergence
- Variable time amplitude amplification and quantum algorithms for linear algebra problems
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
Cited in
(53)- Machine learning meets quantum physics
- Blind quantum machine learning based on quantum circuit model
- Enhancing adversarial robustness of quantum neural networks by adding noise layers
- Approximation of quantum control correction scheme using deep neural networks
- Quantum machine learning
- Quantum error reduction with deep neural network applied at the post-processing stage
- Quantum machine learning
- A survey on HHL algorithm: from theory to application in quantum machine learning
- Quantum algorithm design: techniques and applications
- Supervised learning with quantum computers
- Approximate supervised learning of quantum gates via ancillary qubits
- Machine learning entanglement freedom
- Prospects of quantum-classical optimization for digital design
- A multi-classification classifier based on variational quantum computation
- Tangible reduction in learning sample complexity with large classical samples and small quantum system
- Optimal quantum state transformations based on machine learning
- Quantum reservoir computing: a reservoir approach toward quantum machine learning on near-term quantum devices
- A quantum speedup in machine learning: finding an \(N\)-bit Boolean function for a classification
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
- Geometrical versus time-series representation of data in quantum control learning
- Machine learning algorithms based on generalized Gibbs ensembles
- An Introduction to Quantum Machine Learning for Engineers
- Quantum driven machine learning
- Quantum advantage in learning from experiments
- Quantum science and quantum technology
- The theory of the quantum kernel-based binary classifier
- MAQA: a quantum framework for supervised learning
- Quantum amplitude amplification algorithm simulation for prediction of a binary classification problem
- A quantum convolution autoencoder for handwritten letters and digits: a case study
- A hybrid classical-quantum approach for multi-class classification
- Quantum learning unravels quantum system
- An introduction to quantum computing for statisticians and data scientists
- Quantum-inspired probabilistic database corruption detection
- Chapter 10 A leap among quantum ML and DL models: a review
- Machine learning with quantum computers
- Near-term advances in quantum natural language processing
- Quantum computing and supervised machine learning: training, model selection, and error estimation
- Quantum data structure for range minimum query
- A quantum-inspired classical algorithm for recommendation systems
- Hybrid Helmholtz machines: a gate-based quantum circuit implementation
- SWAP test for an arbitrary number of quantum states
- Verifying Fairness in Quantum Machine Learning
- Quantum natural language processing on near-term quantum computers
- Pattern capacity of a single quantum perceptron
- Continuous variable quantum perceptron
- Sample-size-reduction of quantum states for the noisy linear problem
- Learning quantum models from quantum or classical data
- Learning bounds for quantum circuits in the agnostic setting
- Data rotation and its influence on quantum encoding
- Kernel mean embedding vs kernel density estimation: a quantum perspective
- Preface
- High-entanglement capabilities for variational quantum algorithms: the Poisson equation case
- Quantum deep neural networks for time series analysis
This page was built for publication: Quantum machine learning: a classical perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556858)
