An n-bit general implementation of Shor's quantum period-finding algorithm

TL;DR

This paper presents a scalable, general-purpose implementation of Shor's quantum period-finding algorithm using fundamental quantum gates, serving as a blueprint for optical quantum computing applications.

Contribution

It provides a comprehensive, scalable design for Shor's algorithm that emphasizes fundamental gates and broad applicability, unlike previous specialized or compiled versions.

Findings

Blueprint for linear optical implementation

Scalable design using fundamental gates

Applicable to general and specific N values

Abstract

The goal of this paper is to outline a general-purpose scalable implementation of Shor's period finding algorithm using fundamental quantum gates, and to act as a blueprint for linear optical implementations of Shor's algorithm for both general and specific values of N. This offers a broader view of a problem often overlooked in favour of compiled versions of the algorithm.