Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2411.09336 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909389379600384 |
|---|---|
| author | Metcalf, Mekena Andrés-Martínez, Pablo Fitzpatrick, Nathan |
| author_facet | Metcalf, Mekena Andrés-Martínez, Pablo Fitzpatrick, Nathan |
| contents | Data representation in quantum state space offers an alternative function space for machine learning tasks. However, benchmarking these algorithms at a practical scale has been limited by ineffective simulation methods. We develop a quantum kernel framework using a Matrix Product State (MPS) simulator and employ it to perform a classification task with 165 features and 6400 training data points, well beyond the scale of any prior work. We make use of a circuit ansatz on a linear chain of qubits with increasing interaction distance between qubits. We assess the MPS simulator performance on CPUs and GPUs and, by systematically increasing the qubit interaction distance, we identify a crossover point beyond which the GPU implementation runs faster. We show that quantum kernel model performance improves as the feature dimension and training data increases, which is the first evidence of quantum model performance at scale. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_09336 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Realizing Quantum Kernel Models at Scale with Matrix Product State Simulation Metcalf, Mekena Andrés-Martínez, Pablo Fitzpatrick, Nathan Quantum Physics Data representation in quantum state space offers an alternative function space for machine learning tasks. However, benchmarking these algorithms at a practical scale has been limited by ineffective simulation methods. We develop a quantum kernel framework using a Matrix Product State (MPS) simulator and employ it to perform a classification task with 165 features and 6400 training data points, well beyond the scale of any prior work. We make use of a circuit ansatz on a linear chain of qubits with increasing interaction distance between qubits. We assess the MPS simulator performance on CPUs and GPUs and, by systematically increasing the qubit interaction distance, we identify a crossover point beyond which the GPU implementation runs faster. We show that quantum kernel model performance improves as the feature dimension and training data increases, which is the first evidence of quantum model performance at scale. |
| title | Realizing Quantum Kernel Models at Scale with Matrix Product State Simulation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2411.09336 |