Possible Quantum Decryptian Breakthrough
Researcher show that n-bit integers can be factorized by independently running a quantum circuit with orders of magnitude fewer qubits many times. It then use polynomial-time classical post-processing. The correctness of the algorithm relies on a number-theoretic heuristic assumption reminiscent of those used in subexponential classical factorization algorithms. It is currently not clear if the …
Click to rate this post!
[Total: 0 Average: 0]
You have already voted for this article
(Visited 52 times, 1 visits today)