New answers tagged

5 votes

A necessary and sufficient condition for the existence of a nontrivial square root in Shor's algorithm

I like to think of Shor's algorithm as having a couple of trivial "gotchya's" - situations that, if true, cause the quantum part of the algorithm to output junk or otherwise fail. But, ...
Mark Spinelli's user avatar
10 votes
Accepted

A necessary and sufficient condition for the existence of a nontrivial square root in Shor's algorithm

Every number with at least two odd factors has non-trivial square roots. You get the non-trivial square roots by breaking them down into $\pm 1$ square roots for each factor and applying the Chinese ...
Craig Gidney's user avatar
  • 33.1k
4 votes
Accepted

Why do current large-scale QCs fail to run Shor's algorithm?

Yes, there's a big difference between physical and logical qubits. The (physical) qubits that make up a device such as the IBM one suffer from noise. Basically, errors that mean the operations you're ...
DaftWullie's user avatar
  • 55.7k

Top 50 recent answers are included