Variational quantum eigensolver approach to prime factorization on IBM's noisy intermediate scale quantum computer

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 1 048 561 on a classical simulator. These findings show the potential of the approach for practical applications on near-term quantum computers.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-04-08
DOI
https://doi.org/10.1103/physreva.111.042413
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Variational quantum eigensolver approach to prime factorization on IBM's noisy intermediate scale quantum computer

Tobias Hartung, Yahui Chai, Mona Sobhani, Karl Jansen
2 citations
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
4.96
article

Variational quantum eigensolver approach to prime factorization on IBM's noisy intermediate scale quantum computer

Tobias Hartung, Yahui Chai, Mona Sobhani, Karl Jansen
article en
2 citations

Abstract

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 1 048 561 on a classical simulator. These findings show the potential of the approach for practical applications on near-term quantum computers.

Physical review. A/Physical review, AVol. 111(4)
Cyprus Institute (CY), Deutsches Elektronen-Synchrotron DESY (DE), Brandenburg University of Technology Cottbus-Senftenberg (DE), Universidad del Noreste (MX)
European Commission, Centre for Quantum Technologies, HORIZON EUROPE Framework Programme, European Research Council
Openalex Percentile: Top 6%
Quantum Computing Algorithms and Architecture
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.