Variational Quantum Support Vector Machine based on $\Gamma$ matrix expansion and Variational Universal-Quantum-State Generator

Abstract

We analyze a binary classification problem by using a support vector machine based on variational quantum-circuit model. We propose to solve a linear equation of the support vector machine by using a $\Gamma$ matrix expansion. In addition, it is shown that an arbitrary quantum state is prepared by optimizing a universal quantum circuit representing an arbitrary $U(2^N)$ based on the steepest descent method. It may be a quantum generalization of Field-Programmable-Gate Array (FPGA).

11 pages, 5 figures

References in corpus (15)

• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• An introduction to quantum machine learning
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• A rigorous and robust quantum speed-up in supervised machine learning
• Quantum Data Fitting
• FPGA-based Accelerators of Deep Learning Networks for Learning and Classification: A Review
• Experimental Realization of Quantum Artificial Intelligence
• QUBO Formulations for Training Machine Learning Models
• Quantum machine learning and quantum biomimetics: A perspective
• Quantum Machine-Learning for Eigenstate Filtration in Two-Dimensional Materials
• Certified variational quantum algorithms for eigenstate preparation
• Numerical hardware-efficient variational quantum simulation of a soliton solution
• Universal quantum gates, artificial neurons and pattern recognition simulated by \textit{LC} resonators
• Dirac formulation for universal quantum gates and Shor's integer factorization in high-frequency electric circuits