A quantum speedup in machine learning: finding an N-bit Boolean function for a classification

DOI10.1088/1367-2630/16/10/103014MaRDI QIDQ3387032zbMATH OpenOpenAlexWikidataFDO

Authors Seokwon Yoo, Jeongho Bang, Changhyoup Lee, Jinhyoung Lee

Publication date 12 January 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1303.6055

Mathematics Subject Classification ID

Computational learning theory (68Q32) Artificial neural networks and deep learning (68T07) Quantum computation (81P68)

Abstract: We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution.

Recommendations

• Quantum learning Boolean linear functions w.r.t. product distributions
• Quantum speedup of Bayes’ classifiers
• Quantum machine learning. What quantum computing means to data mining
• Equivalences and Separations Between Quantum and Classical Learnability
• Quantum machine learning: a classical perspective

Cites work

• A strategy for quantum algorithm design assisted by machine learning
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Generalization performance of Bayes optimal classification algorithm for learning a perceptron
• scientific article; zbMATH DE number 3692653 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum artificial neural network architectures and components
• Quantum computation and quantum information. 10th anniversary edition
• Quantum cryptography based on Bell’s theorem
• Quantum Perceptrons
• Rapid solution of problems by quantum computation

Cited in

(13)

• A quantum scheme of state overlap based on quantum mean estimation and support vector machine
• Blind quantum machine learning based on quantum circuit model
• Improved handwritten digit recognition using quantum \(K\)-nearest neighbor algorithm
• Quantum adiabatic machine learning
• Hybrid Helmholtz machines: a gate-based quantum circuit implementation
• Tangible reduction in learning sample complexity with large classical samples and small quantum system
• QBoost for regression problems: solving partial differential equations
• Optimal quantum state transformations based on machine learning
• Robustness of Greenberger-Horne-Zeilinger and W states against Dzyaloshinskii-Moriya interaction
• A strategy for quantum algorithm design assisted by machine learning
• Learning quantum models from quantum or classical data
• Quantum speedup of Bayes’ classifiers
• Protocol for secure quantum machine learning at a distant place

This page was built for publication: A quantum speedup in machine learning: finding an \(N\)-bit Boolean function for a classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387032)