A Novel AQC Factoring Algorithm

TL;DR

This paper introduces a new classical factoring algorithm that is converted into a quantum framework using graph theory and group theory, aiming to inspire innovative problem-solving methods with quantum computers.

Contribution

The paper presents a novel classical factoring algorithm and its conversion into a quantum approach via graph theory, highlighting the transition process and performance comparison.

Findings

The quantum version of the algorithm shows promising performance.

The graph-theoretic approach simplifies the quantum implementation.

The method encourages creative problem-solving in quantum computing.

Abstract

Due to recent technological advances, actual quantum devices are being constructed and used to perform computations. As a result, many classical problems are being restated so as to be solved on quantum computers. Some examples include satisfiability problems; clustering and classification; protein folding; and simulating many-body systems. Converting these classical problems to a quantum framework is not always straightforward. As such, instances where researchers explicitly elucidate the conversion process are not only valuable in their own right, but are likely to spawn new ideas and creative ways in regards to problem solving. In this paper, we propose a classical factoring algorithm, which we then convert into a quantum framework. Along the way, we discuss the subtle similarities and differences between the approaches, and provide a general comparison of their performance. It is our desire to not only introduce an interesting approach to factoring, but to hopefully promote more creative ways to solving problems using quantum computers. The key to our algorithm is that we convert the factoring problem to a graph theory problem using elements from group theory. The move to a graph-theoretic approach ultimately eases the transition to a quantum setting.