HackerPapers

arXiv:1712.05561quant-ph

Design of Quantum Annealing Machine for Prime Factoring

M. Maezawa, K. Imafuku, M. Hidaka, H. Koike, S. Kawabata

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
3 pages, 6 figures, to appear in IEEE Xplore Conference Proceedings of the 16th International Superconductive Electronics Conference (ISEC 2017)
Journal reference
DOI
Subjects
quant-phQuantum Physics cond-mat.mes-hallMesoscale and Nanoscale Physics cond-mat.supr-conSuperconductivity cs.ETEmerging Technologies

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Dec 2017 to Dec 2017. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.