A Novel AQC Factoring Algorithm
Matthew B. Crawford

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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
