Design of Quantum Annealing Machine for Prime Factoring
M. Maezawa, K. Imafuku, M. Hidaka, H. Koike, S. Kawabata

TL;DR
This paper introduces a quantum annealing-based prime factoring machine that uses an inverse operation approach, specialized architecture, and superconducting technology for scalable implementation.
Contribution
It presents a novel QA architecture for prime factoring, including a 3D packaging scheme and design considerations for large-scale quantum annealing systems.
Findings
Proposed a QA-based prime factoring method.
Designed a specialized annealing architecture.
Outlined a scalable qubit packaging scheme.
Abstract
We propose a prime factoring machine operated in a frame work of quantum annealing (QA). The idea is inverse operation of a quantum-mechanically reversible multiplier implemented with QA-based Boolean logic circuits. We designed the QA machine on an application-specific-annealing-computing architecture which efficiently increases available hardware budgets at the cost of restricted functionality. The circuits are to be implemented and fabricated by using superconducting integrated circuit technology. We propose a three-dimensional packaging scheme of a qubit-chip / interposer / package-substrate structure for realizing practically-large scale QA systems.
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-Dot Cellular Automata
