3 ms·

What about Schor’s algorithm?

• scheme271 8mo ago
  That's on the useful end but I don't think any QC has gone beyond being able to factor 14 or something in that neighborhood. Realistically we'd need a few thousand qubits to factor anything that's reasonable and current QCs have a dozen or so qubits that work.
  • vrighter 8mo ago
    no QC has gone beyond being able to factor 1. The "factorization" done with quantum computers involved cherry picking special numbers so that a special "compiled" circuit (knowledge of the answer is required in order to do this) can be used instead of the full thing. That makes the semantics of the executed program "slightly" different. What the claims say: factor(a,b) What the implementation does: println("3").
    • scheme271 7mo ago
      Oh, I didn't realize that. I knew it was limited but not that limited. That's pretty misleading.
• mapt 8mo ago
  On the one hand you have strong and persistent claims about quantum factoring of large numbers On the other hand you have https://algassert.com/post/2500 https://algassert.com/post/2500
  • moi2388 8mo ago
    Thank you for that. I had no idea, very interesting read!