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 Quantum algorithms: an overview
Tag: quantum
Quantum computing in the NISQ era and beyond
Quantum computing in the NISQ era and beyond Preskill, Q2B 2017 Today’s paper is based on the keynote address given by John Preskill at the December 2017 ‘Quantum computing for business’ conference. It provides a great overview of the state of quantum computing today, and what we might reasonably expect to see over the coming … Continue reading Quantum computing in the NISQ era and beyond
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
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 Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
the morning paper 