手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| 量子サポートベクターマシン× | Quantum Approximate Optimization Algorithm× | |
|---|---|---|
| 分野 | 量子コンピューティング | 量子コンピューティング |
| 系統 | Machine learning | Machine learning |
| 提唱年 | 2014 | 2014 |
| 提唱者≠ | Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd | Edward Farhi |
| 種類≠ | Machine learning algorithm | Hybrid quantum-classical algorithm |
| 原典≠ | Rebentrost, P., Mohseni, M., Lloyd, S. (2014). Quantum support vector machine for big data classification. Physical Review Letters, 113, 130503. DOI ↗ | Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗ |
| 別名 | QSVM, quantum kernel | QAOA, quantum alternating operator ansatz |
| 関連≠ | 2 | 4 |
| 概要≠ | Quantum Support Vector Machine (QSVM) is a quantum machine learning algorithm combining quantum feature spaces with classical SVM training. Proposed by Rebentrost et al. in 2014, QSVM leverages quantum processors to compute kernel functions, potentially offering speedup for classification problems while remaining practical on near-term quantum devices. | The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm designed to solve combinatorial optimization problems on near-term quantum devices. Introduced by Farhi, Goldstone, and Gutmann in 2014, QAOA encodes optimization problems into quantum circuits and uses classical optimization to tune circuit parameters, aiming to find approximately optimal solutions for problems like MaxCut, graph coloring, and scheduling. |
| ScholarGateデータセット ↗ |
|
|