Pith. sign in

REVIEW

Design of Quantum Annealing Machine for Prime Factoring

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1712.05561 v1 pith:L77FZSMQ submitted 2017-12-15 quant-ph cond-mat.mes-hallcond-mat.supr-concs.ET

classification quant-phcond-mat.mes-hallcond-mat.supr-concs.ET
keywords machineannealingcircuitsfactoringimplementedprimeproposequantum
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools