pith. sign in

arxiv: 1712.05561 · v1 · pith:L77FZSMQnew · submitted 2017-12-15 · 🪐 quant-ph · cond-mat.mes-hall· cond-mat.supr-con· cs.ET

Design of Quantum Annealing Machine for Prime Factoring

classification 🪐 quant-ph cond-mat.mes-hallcond-mat.supr-concs.ET
keywords machineannealingcircuitsfactoringimplementedprimeproposequantum
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.