Variational Quantum Support Vector Machine based on 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 matrix expansion. In addition, it is shown that an arbitrary quantum state is prepared by optimizing a universal quantum circuit representing an arbitrary U(2N) based on the steepest descent method. It may be a quantum generalization of Field-Programmable-Gate Array (FPGA).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.