HackerPapers

arXiv:1411.6758quant-ph

Quantum factorization of 56153 with only 4 qubits

Nikesh S. Dattani, Nathaniel Bryans

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The largest number factored on a quantum device reported until now was 143. That quantum computation, which used only 4 qubits at 300K, actually also factored much larger numbers such as 3599, 11663, and 56153, without the awareness of the authors of that work. Furthermore, unlike the implementations of Shor's algorithm performed thus far, these 4-qubit factorizations do not need to use prior knowledge of the answer. However, because they only use 4 qubits, these factorizations can also be performed trivially on classical computers. We discover a class of numbers for which the power of quantum information actually comes into play. We then demonstrate a 3-qubit factorization of 175, which would be the first quantum factorization of a triprime.

arXiv comments
Replaced 44929 with larger number (56153) that results in same Hamiltonian as 143, edited corresponding table and equations. Similarly replaced 13081 with 11663. Fixed typo in equations 14, 15, 19-21
Journal reference
DOI
Subjects
quant-phQuantum Physics cs.DMDiscrete Mathematics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2019 to Oct 2019. Found in 2 HN submissions from Nov 2014 to Sep 2015. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. The “Talk” 1 comment
    • Check out Shor's algorithm for finding factors of a number. And yes, a low number of qubits can factor small numbers. https://arxiv.org/abs/1411.6758

      bytecodesView on HNParent context

Submitted to Hacker News

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