But even under these conditions no team has been able to demonstrate a working implementation of Shor's algorithm that can factor arbitrary 6-bit prime products

But even under these conditions no team has been able to demonstrate a working implementation of Shor's algorithm that can factor arbitrary 6-bit prime products. Quoting from [1]: > In 2019 an attempt was made to factor the number {\displaystyle 35}{\displaystyle 35} using Shor's algorithm on an IBM Q System One, but the algorithm failed because of accumulating errors.[13] Though larger numbers have been factored by quantum computers using other algorithms,[14] these algorithms are similar to classical brute-force checking of factors, so unlike Shor's algorithm, they are not expected to ever perform better than classical factoring algorithms. [1] https://en.wikipedia.org/wiki/Shor%27s_algorithm#See_also https://en.wikipedia.org/wiki/Shor%27s_algorithm#See_also