Variational Quantum Eigensolver Approach to Prime Factorization on IBM's Noisy Intermediate Scale Quantum Computer
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910884995006464 |
|---|---|
| author | Sobhani, Mona Chai, Yahui Hartung, Tobias Jansen, Karl |
| author_facet | Sobhani, Mona Chai, Yahui Hartung, Tobias Jansen, Karl |
| contents | This paper presents a hybrid quantum-classical approach to prime factorization. The proposed algorithm is based on the Variational Quantum Eigensolver (VQE), which employs a classical optimizer to find the ground state of a given Hamiltonian. A numerical study is presented, evaluating the performance of the proposed method across various instances on both IBM's real quantum computer and its classical simulator. The results demonstrate that the method is capable of successfully factorizing numbers up to 253 on a real quantum computer and up to 1048561 on a classical simulator. These findings show the potential of the approach for practical applications on near-term quantum computers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_01935 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Variational Quantum Eigensolver Approach to Prime Factorization on IBM's Noisy Intermediate Scale Quantum Computer Sobhani, Mona Chai, Yahui Hartung, Tobias Jansen, Karl Quantum Physics This paper presents a hybrid quantum-classical approach to prime factorization. The proposed algorithm is based on the Variational Quantum Eigensolver (VQE), which employs a classical optimizer to find the ground state of a given Hamiltonian. A numerical study is presented, evaluating the performance of the proposed method across various instances on both IBM's real quantum computer and its classical simulator. The results demonstrate that the method is capable of successfully factorizing numbers up to 253 on a real quantum computer and up to 1048561 on a classical simulator. These findings show the potential of the approach for practical applications on near-term quantum computers. |
| title | Variational Quantum Eigensolver Approach to Prime Factorization on IBM's Noisy Intermediate Scale Quantum Computer |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2410.01935 |