TNW-20-2_page_37

TNW-20-2 | page 37 | https://thedailydialectics.com/pdfs/FIOA/TNW-20-2/TNW-20-2.pdf

prime factors of a number—a problem of historic interest that gets extremely difficult as the number to be factored gets larger and larger. Shor’s Algo- rithm for factoring remains one of the best-known examples of a seemingly intractable problem that is potentially solved using a quantum computer.…