Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more
4 votes
Accepted

Classical computation required in Shor's algorithm: are they heavy?

My guess is that a laptop would be sufficient for computing the lookup tables and delayed choice fixups and various other things-that-aren't-error-correction on the fly. There's tens of microseconds ...
Craig Gidney's user avatar
  • 37.5k
2 votes

Simulating any fixed time classical circuit in time poly(t) on a quantum computer

In talking to some professors I found the answer myself. The statement does indeed hold (and is probably proven using the universality of the Toffili gate). The reason I was confused with the binary ...
Thyrum's user avatar
  • 61

Only top scored, non community-wiki answers of a minimum length are eligible