Quantum machine learning: a classical perspective
From MaRDI portal
Publication:4556858
DOI10.1098/rspa.2017.0551zbMath1402.68154arXiv1707.08561OpenAlexW2736592352WikidataQ51419979 ScholiaQ51419979MaRDI QIDQ4556858
Massimiliano Pontil, Simone Severini, Alessandro Davide Ialongo, Leonard Wossnig, Andrea Rocchetto, Mark Herbster, Carlo Ciliberto
Publication date: 28 November 2018
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.08561
Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68) History of mathematics in the 21st century (01A61) History of computer science (68-03)
Related Items
Quantum amplitude amplification algorithm simulation for prediction of a binary classification problem, Tangible reduction in learning sample complexity with large classical samples and small quantum system, SWAP test for an arbitrary number of quantum states, A multi-classification classifier based on variational quantum computation, A hybrid classical-quantum approach for multi-class classification, The theory of the quantum kernel-based binary classifier, Approximate supervised learning of quantum gates via ancillary qubits, Quantum science and quantum technology, Quantum algorithm design: techniques and applications, Quantum driven machine learning, Continuous variable quantum perceptron, Approximation of quantum control correction scheme using deep neural networks, Quantum error reduction with deep neural network applied at the post-processing stage
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- The quest for a quantum neural network
- On regularization algorithms in learning theory
- Matrix multiplication via arithmetic progressions
- A faster strongly polynomial time algorithm for submodular function minimization
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- An improved lower bound on query complexity for quantum PAC learning
- Queries and concept learning
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Optimal rates for the regularized least-squares algorithm
- Improved bounds on quantum learning algorithms
- The computational complexity of probabilistic inference using Bayesian belief networks
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Sequential Monte Carlo Methods in Practice
- On the mathematical foundations of learning
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Search via Quantum Walk
- Quantum Computation and Quantum Information
- Tensor completion and low-n-rank tensor recovery via convex optimization
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Markov Random Fields and Their Applications
- Quantum Random Access Memory
- Training Products of Experts by Minimizing Contrastive Divergence
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Sequential Monte Carlo Samplers
- Quantum Algorithms for Some Hidden Shift Problems
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- The quantum adiabatic optimization algorithm and local minima
- Smoothed analysis of algorithms
- A theory of the learnable
- Fast Parallel Matrix Inversion Algorithms
- On the inherent intractability of certain coding problems (Corresp.)
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Cryptographic limitations on learning Boolean formulae and finite automata
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Equivalences and Separations Between Quantum and Classical Learnability
- On the role of entanglement in quantum-computational speed-up
- 10.1162/153244303321897681
- Adaptive Rejection Sampling for Gibbs Sampling
- Semidefinite Programming
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Skepticism of quantum computing
- On the robustness of bucket brigade quantum RAM
- Learning DNF in time
- Computational Complexity
- Most Tensor Problems Are NP-Hard
- Fast monte-carlo algorithms for finding low-rank approximations
- Some optimal inapproximability results
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Approximation by superpositions of a sigmoidal function
