Computational premise (con’t)

• N particles

  • 2N unique subsets

• Computations are sequential

  • Select 1 subset
  • Operate on it
  • Put it back into memory

• Example: N=3

  • 3 bits
  • 8 states
  • Work on one number at a time
    • x = 101

• N particles

  • 2N unique subsets

• Computations occur in parallel

  • Subsets interact
    • They are entangled
  • Operate on all subsets at once

• Example: N=3

  • 3 qbits
  • 8 complex amplitudes
  • Operator manipulates 8 at once

Classical Computer

Quantum Computer

? Exponential Speedup

Previous slide

Next slide

Back to first slide

View graphic version