Experimental factoring integers using fixed-point-QAOA with a trapped-ion quantum processor

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 the Shor's algorithm for realistic tasks, which are beyond the capabilities of existing and upcoming generations of quantum computing devices, motivates 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 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\times 43$ using 6 qubits as well as simulation results for $74425657=9521\times 7817$ with 10 qubits and $35183361263263=4194191\times 8388593$ with 15 qubits. Alongside, we present all the necessary details for reproducing our results and analysis of the performance of the factoring method, the scalability of this approach both in classical and quantum domain still requires further studies.

4 pages, 2 figures

References in corpus (24)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Efficient Z-Gates for Quantum Computing
• Towards fault-tolerant quantum computing with trapped ions
• Realization of a scalable Shor algorithm
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Characterizing Quantum Gates via Randomized Benchmarking
• Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
• Experimental demonstration of Shor's algorithm with quantum entanglement
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Computing prime factors with a Josephson phase qubit quantum processor
• Demonstration of Shor's quantum factoring algorithm using photonic qubits
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• Arbitrarily accurate composite pulses
• Optimal quantum control of multi-mode couplings between trapped ion qubits for scalable entanglement
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
• Digitized-Counterdiabatic Quantum Optimization
• Towards security recommendations for public-key infrastructures for production environments in the post-quantum era
• Towards multiqudit quantum processor based on a ${}^{171}$Yb${}^{+}$ ion string: Realizing basic quantum algorithms
• Quantum tomography of noisy ion-based qudits
• Pitfalls of the sublinear QAOA-based factorization algorithm

Cited by in corpus (1)

• Evidence for effectively constant shot complexity in the quantum approximate optimization algorithm without per-instance optimization