Benchmarks for quantum computers from Shor's algorithm

Abstract

Properties of Shor's algorithm and the related period-finding algorithm could serve as benchmarks for the operation of a quantum computer. Distinctive universal behaviour is expected for the probability for success of the period-finding algorithm as the input quantum register is increased through its critical size of ${\mathfrak{m}}_0=\lceil 2{\log }_{2}r\rceil$ qubits (where $r$ is the period sought). Use of quadratic non-residues permits unequivocal predictions to be made about the outcome of the factoring algorithm.

10 pages, 3 figures

References in corpus (1)

• Verification of quantum computation: An overview of existing approaches

Cited by in corpus (1)

• On the success probability of quantum order finding