Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Experimental Analysis of the Optimization-Based Factorization Algorithm

Junpei Yamaguchi, Tetsuya Izu, Noboru Kunihiro

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-981-96-5566-3_8

Related papers

Improving the Success Probability for Shor’s Factorization Algorithm

Guoliang Xu, Daowen Qiu, Xiangfu Zou +1 more

Emergence, complexity and computation•Jan 1, 2018•6 citations

Experimental Factoring Integers Using Fixed-Point-QAOA with a Trapped-Ion Quantum Processor

Ilia V. Zalivako, Andrey Yu. Chernyavskiy, Anastasiia S. Nikolaeva +10 more

Abstract Factoring integers is considered as a computationally hard problem for classical methods, whereas there exists polynomial-time Shor’s quantum algorithm for solving this task. However, requirements for running Shor’s algorithm for realistic tasks, which are beyond the capabilities of existing and upcoming generations of quantum computing devices, motivate to search for alternative approaches. In this work, we experimentally demonstrate factoring of the integer with a trapped ion quantum processor using the Schnorr approach and a modified version of the quantum approximate optimization algorithm (QAOA). The key difference of our approach in comparison with the recently proposed QAOA-based factoring method is the use of the fixed-point feature, which relies on the use of universal parameters. We present experimental results on factoring 1591 = 37 × 43 using 6 qubits as well as simulation results for 74425657 = 9521 × 7817 with 10 qubits and 35183361263263 = 4194191 × 8388593 with 15 qubits. Although we present all the necessary details for reproducing our results and analysis of the performance of the factoring method, the scalability of this approach in both the classical and quantum domains still requires further studies.

arXiv:2503.10588•Quantum Information and Computation•Dec 1, 2025•4 citations

A Simple Rank Testing Procedure and Complexity Analysis for the Factorization Algorithm

Dhananjay P. Mehendale, Pramod S. Joag

Quantum Physics Letters•Apr 1, 2019•0 citations

Analysis of influence factors in Quantum Approximate Optimization Algorithm for Solving Max-cut Problem

Jing Wang, Junsen Lai, Meng Zhang +2 more

In recent years, quantum algorithm research has developed rapidly, and it has become an important mode to use quantum computing cloud platform to carry out algorithm application exploration. Quantum approximate optimization algorithm can be used to solve the max-cut problem. In the process of algorithm execution, optimizer and various noise had obvious influence on the algorithm execution result. For the quantum computing simulator of HiQ platform, quantum approximate optimization algorithm was used for experimental verification, to study the types of optimizer, different noise scenarios, and the impact of noise error parameters on the maximum number of cutting edges. The prospect of quantum algorithm research was also discussed.

International Conference on Optical Communications and Networks (ICOCN)•Jul 31, 2023•5 citations

Analysis of Influencing Factors in Quantum Neural Network for Solving Classification Problem

Jing Wang, Meng Zhang, Junsen Lai +1 more

In recent years, the research verification and application exploration of quantum algorithms have developed more rapidly. Quantum algorithm exploration and verification based on quantum computing cloud platform has become one of the important ways. Quantum Neural Network (QNN) combines quantum computing theory with artificial neural network, which is expected to provide potential solutions for classification problems and so on. In the algorithm execution process, factors such as encoding layer, ansatz, and optimizer have all influenced the results. Based on the quantum simulator provided on the quantum computing cloud platform, QNN has been used for experimental validation to study the effects of encoding methods, ansatz types and optimizer variations on the accuracy of QNN training results. Additionally, this artical provides insights into the future trends of quantum algorithm development.

International Conference on Optical Communications and Networks (ICOCN)•Jul 26, 2024•0 citations

On-chip factorization

David F. P. Pile

Nature Photonics•Oct 30, 2009•3 citations
Abstract Factoring integers is considered as a computationally hard problem for classical methods, whereas there exists polynomial-time Shor’s quantum algorithm for solving this task. However, requirements for running Shor’s algorithm for realistic tasks, which are beyond the capabilities of existing and upcoming generations of quantum computing devices, motivate to search for alternative approaches. In this work, we experimentally demonstrate factoring of the integer with a trapped ion quantum processor using the Schnorr approach and a modified version of the quantum approximate optimization algorithm (QAOA). The key difference of our approach in comparison with the recently proposed QAOA-based factoring method is the use of the fixed-point feature, which relies on the use of universal parameters. We present experimental results on factoring 1591 = 37 × 43 using 6 qubits as well as simulation results for 74425657 = 9521 × 7817 with 10 qubits and 35183361263263 = 4194191 × 8388593 with 15 qubits. Although we present all the necessary details for reproducing our results and analysis of the performance of the factoring method, the scalability of this approach in both the classical and quantum domains still requires further studies.
In recent years, quantum algorithm research has developed rapidly, and it has become an important mode to use quantum computing cloud platform to carry out algorithm application exploration. Quantum approximate optimization algorithm can be used to solve the max-cut problem. In the process of algorithm execution, optimizer and various noise had obvious influence on the algorithm execution result. For the quantum computing simulator of HiQ platform, quantum approximate optimization algorithm was used for experimental verification, to study the types of optimizer, different noise scenarios, and the impact of noise error parameters on the maximum number of cutting edges. The prospect of quantum algorithm research was also discussed.
In recent years, the research verification and application exploration of quantum algorithms have developed more rapidly. Quantum algorithm exploration and verification based on quantum computing cloud platform has become one of the important ways. Quantum Neural Network (QNN) combines quantum computing theory with artificial neural network, which is expected to provide potential solutions for classification problems and so on. In the algorithm execution process, factors such as encoding layer, ansatz, and optimizer have all influenced the results. Based on the quantum simulator provided on the quantum computing cloud platform, QNN has been used for experimental validation to study the effects of encoding methods, ansatz types and optimizer variations on the accuracy of QNN training results. Additionally, this artical provides insights into the future trends of quantum algorithm development.