Computing prime factors with a Josephson phase qubit quantum processor · HackerPapers discussions

Computing prime factors with a Josephson phase qubit quantum processor — mentioned by Strilanc

Sat, 23 Nov 2024 18:55:29 GMT

I'm not trying to be evasive. I'm directly saying quantum computers won't factor interesting numbers for years. That's more typically described as biting the bullet. There are several experiments that claim to factor 15 with a quantum computer (e.g. [1][2]). But beware these experiments cheat to various degrees (e.g. instead of performing period finding against multiplication mod 15 they do some simpler process known to have the same period). Even without cheating, 15 is a huge outlier in the simplicity of the modular arithmetic. For example, I think 15 is the only odd semiprime where you can…

Paper and discussion history. A mention is not an endorsement.

Computing prime factors with a Josephson phase qubit quantum processor — mentioned by vtomole

Thu, 20 Jun 2019 03:18:24 GMT

> Can a QC finally factor 15? For compiled versions of Shor's algorithm, yes. https://arxiv.org/abs/1202.5707

Paper and discussion history. A mention is not an endorsement.

Computing prime factors with a Josephson phase qubit quantum processor — mentioned by andyjohnson0

Wed, 22 Jul 2015 11:41:47 GMT

The paper describes a "proposed" algorithm with a lot of theoretical justification [1]. Is there any way to verify it on a real quantum computer or reliable simulation? I'm thinking of the way that Shor's algorithm was verified [2] using a real quantum device. [1] I'm not qualified to understand the detail of the paper, although I can appreciate its general outline and the broad consequences of it being correct. [2] http://arxiv.org/abs/1202.5707

Paper and discussion history. A mention is not an endorsement.