Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines
원문 초록
Machine learning is considered to be one of the most promising applications of quantum computing. Therefore, the search for quantum advantage of the quantum analogues of machine learning models is a key research goal. Here, we show that variational quantum classifiers and support vector machines with quantum kernels can solve a classification problem based on the $k$-Forrelation problem, which is known to be PromiseBQP-complete. Because the PromiseBQP complexity class includes all Bounded-Error Quantum Polynomial-Time (BQP) decision problems, our results imply that there exists a feature map and a quantum kernel that make variational quantum classifiers and quantum kernel support vector machines efficient solvers for any BQP problem. Hence, this work implies that their feature map and quantum kernel, respectively, can be designed to have a quantum advantage for any classification problem that cannot be classically solved in polynomial time but contrariwise by a quantum computer.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AnalogVNN: A fully modular framework for modeling and optimizing photonic neural networks
Evolutionary bagging for ensemble learning
Neural network accelerator for quantum control
Deep Reinforcement Learning for Multi-Agent Interaction
Disparate Censorship & Undertesting: A Source of Label Bias in Clinical Machine Learning
Unsupervised machine learning framework for discriminating major variants of concern during COVID-19
토론
이 논문과 연결된 포럼 글이 아직 없습니다.