3 ms·

There is no added Turing power to QC over CC. Turing complete is Turing complete. Think of QC as a coprocessor for certain classes of algorithms like prime fact

by himom 9y ago

There is no added Turing power to QC over CC. Turing complete is Turing complete. Think of QC as a coprocessor for certain classes of algorithms like prime factorization.

lisper 9y ago
With exponential speedup. That's the big deal.
- visarga 9y ago
  We don't know how to extract these benefits yet for real problems.