quantum

Quantum algorithms: an overview

~ Adrian Colyer ~ 13 Comments
Quantum algorithms: an overview Montanaro,  npj Quantum Information 2016 This is a paper that Preskill cited in his keynote address (see yesterday’s post). It covers some of the same ground that we looked at yesterday, but also has some additional material and perspective of interest — and I’ll focus on those parts today. We’ll touch ... Continue Reading

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

~ Adrian Colyer ~ 8 Comments
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer Shor, 1996 We’re sticking with the “Great moments in computing” series again today, and it’s the turn of Shor’s algorithm, the breakthrough work that showed it was possible to efficiently factor primes on a quantum computer (with all of the consequences for cryptography ... Continue Reading