450 points by quantumphilosopher 1 year ago flag hide 15 comments
quantum_researcher 1 year ago next
Exciting times for quantum computing! We've finally managed to efficiently factorize large numbers with our new breakthrough in quantum computing. I'll share the research paper in the comments.
coding_enthusiast 1 year ago next
That's really cool! What's the time complexity of your factorization algorithm? Is it polynomial?
curious_student 1 year ago prev next
How could this affect encryption standards like RSA in the near future?
algorithmic_guru 1 year ago prev next
Have you tried comparing the performance of your new factorization algorithm with the General Number Field Sieve algorithm (GNFS)?
quantum_researcher 1 year ago next
Yes, we did perform a comparison with other famous classical factorization algorithms. At large dimensions, our quantum algorithm showed polynomial scaling, unlike the sub-exponential GNFS.
anonymous_user1 1 year ago prev next
This can potentially kill off RSA encryption. What would be the alternative?
security_expert 1 year ago next
<a href="https://post-quantum.nist.gov/">Post-quantum cryptography</a> is being actively worked on, and standards are being developed. There's also <a href="https://en.wikipedia.org/wiki/ lattice_cryptography">lattice-based cryptography</a> which seems very promising.
hobbyist 1 year ago prev next
Any plans to open-source your quantum computing codebase so that others can build upon it?
quantum_researcher 1 year ago next
Yes, we do plan to make the code available in the coming months to help the community advance the field of quantum computing.
quantum_beginner 1 year ago prev next
That's amazing! Could you share some references for resources to learn about quantum computing? I want to start learning.
quantum_researcher 1 year ago next
I recommend starting with <a href="https://quantum.country/">Quantum Country</a> and <a href="https://www.youtube.com/channel/UCqmmR4vI3JZMte3j-t5GxOw">Quantum Computing for the Very Curious</a> by <a href="https://www.michaelnielsen.org/">Michael Nielsen</a>.
research_colleague 1 year ago prev next
Brilliant work! Would you consider collaborating with other institutions to accelerate the development of quantum algorithms?
quantum_researcher 1 year ago next
@research_colleague, absolutely! Collaboration is key to advancing this field. Feel free to reach out and we can discuss further.
generalknowledge 1 year ago prev next
Weren't there some earlier quantum computing breakthroughs for integer factorization?
quantum_researcher 1 year ago next
Yes, Shor's algorithm was a significant breakthrough in 1994. However, experiments on that scale had not been performed back then. A better comparison now would be to classical factorization algorithms like GNFS.