4 ms·
Is it able to factor 21 without precompilation and other tricks?
by DebtDeflation 5y ago
Is it able to factor 21 without precompilation and other tricks?
- fsh 5y agoOnly if they figure out how to encode 21 with two bits.
- messe 5y agoThat’s trivial[1]: 11 = 21 10 = 7 01 = 3 00 = FileNotFound [1]: https://thedailywtf.com/articles/What_Is_Truth_0x3f_ https://thedailywtf.com/articles/What_Is_Truth_0x3f_
- bdamm 5y agoI know you're joking, but, this is not how Shor's algorithm works.
- messe 5y agoSure it is; with the right isomorphism. (Edit: I have a mathematical physics degree; everything I’ve said here is sarcastic/jokingly. The person I’m replying to is right, this is not how Shor’s algorithm works although I’d hope that was obvious from my original tongue in cheek comment)
- Maursault 5y agoThank you for this.
- upofadown 5y agoThose are physical bits. It is nowhere close to even a single logical bit that could do stuff like that. They are showing us what they can do. Now someone has to figure out how to turn it into something practical. I think the current goal is the factorization of 15. There is no reason to suggest insane levels of challenge like 21.
- metadat 5y agoI can't tell if parent is serious or joking.
- DebtDeflation 5y agoSerious. https://scottlocklin.wordpress.com/2019/01/15/quantum-computing-as-a-field-is-obvious-bullshit/ https://scottlocklin.wordpress.com/2019/01/15/quantum-comput...