Can I read Quantum Approximate Optimization and K-means Algorithms for Data Clustering on EtoBox?

Quantum Approximate Optimization and K-means Algorithms for Data Clustering by Jirawat Saiphet; Sujin Suwanna; Thiparat Chotibut; Areeya Chantasri is a Physics and Astronomy article available to read on EtoBox.

What is Quantum Approximate Optimization and K-means Algorithms for Data Clustering about?

## Abstract Noisy intermediate-scale quantum (NISQ) devices are cutting-edge technology expected to demonstrate potential and advantages of quantum computing over classical computing. Its low number of qubits and imperfection from noises restrict running full-scale quantum algorithms on such devices; however, quantum advantages can still be obtained. To achieve quantum advantages from NISQ devices, the hybrid quantum-classical algorithms were introduced. Quantum approximate optimization algorithm (QAOA) is a variational hybrid algorithm, which utilizes a NISQ device as a sub-unit for specific tasks and performs most calculations on a classical computer. QAOA provides an approximate solution, with arbitrary precision as the number of operations increases, for optimization problems. In this work we investigate the possibility of applying QAOA to a clustering problem and compare its performance with the classical k-means algorithm. It turns out that the weights in graph connectivity can degrade the algorithm operation and make it more difficult to approximate the solution. We also benchmark the QAOA by comparing the approximated solutions with the exact one obtained from a classical c

Who reads Quantum Approximate Optimization and K-means Algorithms for Data Clustering?

Author

Jirawat Saiphet; Sujin Suwanna; Thiparat Chotibut; Areeya Chantasri

Publisher

IOP Publishing

Published

2021

Language

EN

Field

Physics and Astronomy (Physical Sciences)