Large-Scale Simulation of Shor's Quantum Factoring Algorithm

Abstract

Shor's factoring algorithm is one of the most anticipated applications of quantum computing. However, the limited capabilities of today's quantum computers only permit a study of Shor's algorithm for very small numbers. Here we show how large GPU-based supercomputers can be used to assess the performance of Shor's algorithm for numbers that are out of reach for current and near-term quantum hardware. First, we study Shor's original factoring algorithm. While theoretical bounds suggest success probabilities of only 3-4 %, we find average success probabilities above 50 %, due to a high frequency of "lucky" cases, defined as successful factorizations despite unmet sufficient conditions. Second, we investigate a powerful post-processing procedure, by which the success probability can be brought arbitrarily close to one, with only a single run of Shor's quantum algorithm. Finally, we study the effectiveness of this post-processing procedure in the presence of typical errors in quantum processing hardware. We find that the quantum factoring algorithm exhibits a particular form of universality and resilience against the different types of errors. The largest semiprime that we have factored by executing Shor's algorithm on a GPU-based supercomputer, without exploiting prior knowledge of the solution, is 549755813701 = 712321 * 771781. We put forward the challenge of factoring, without oversimplification, a non-trivial semiprime larger than this number on any quantum computing device.

differs from the published version in formatting and style; open source code available at https://jugit.fz-juelich.de/qip/shorgpu

References in corpus (17)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Approaching Unit Visibility for Control of a Superconducting Qubit with Dispersive Readout
• Shor's quantum factoring algorithm on a photonic chip
• Qubit-photon interactions in a cavity: Measurement induced dephasing and number splitting
• Experimental demonstration of Shor's algorithm with quantum entanglement
• High-Fidelity Readout in Circuit Quantum Electrodynamics Using the Jaynes-Cummings Nonlinearity
• Demonstration of Shor's quantum factoring algorithm using photonic qubits
• Massive Parallel Quantum Computer Simulator
• Fast Quantum Modular Exponentiation
• A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
• Improved Superconducting Qubit Readout by Qubit-Induced Nonlinearities
• Benchmarking gate-based quantum computers
• An Experimental Study of Shor's Factoring Algorithm on IBM Q
• Scalability of Shor's algorithm with a limited set of rotation gates
• Faster Quantum Number Factoring via Circuit Synthesis
• A tree tensor network approach to simulating Shor's algorithm
• Odd orders in Shor's factoring algorithm