An open research effort is only as strong as the decision around motivating the participants. ForShor starts with a specific problem within Shor’s algorithm, providing contributors a shared starting point before branching off with additional refinements. Although the general structure of Shor’s algorithm is well established, finding more efficient ways to implement its components remains an important research task. Different constructions can perform the same computation while requiring different quantum resources.
Our team has identified a well-defined “policy search” problem within the design of recursive arithmetic circuits for Shor’s algorithm (see paper for details). Roughly speaking, each “policy” determines the structure of the recursion for the quantum circuit. Participants can submit candidate policies to the ForShor site and the harness will automatically validate and integrate into the pool of existing solutions.
The framework also makes participation possible without requiring every contributor to reconstruct the entire algorithm and its correctness argument. Participants can focus their efforts on the exposed problem while following the supporting material (paper and doc site) as deeply as they choose.
To facilitate discussion and community interaction, we have also set up a Discord server for anyone interested to join. Top contributions will be recognized as citable artifacts and select participants will be invited to collaborate with us on further dedicated research topics at the intersection of quantum computing and agentic automation.
