Scientific American - Los Alamos National Lab – Decoherence is bad for quantum computing, but fortunately there are ways to fight it. Fault-tolerant gates are one of them. Optimized quantum circuits obtained via ML compilers are another. Here LANL researchers report using quantum computers to compile their own programs. Hey, we are getting away from low level assembly like code and circuits. Love it.

Quanta magazine - Caltech - MIT – Using computers to verify that a solution given to a problem is exact is a common cryptographic setting. Think of digital signatures, its easy to check but without the private key you can't encode, i.e find the solution to the problem. When using quantum computers, you can verify efficiently the solutions to some of the hardest imaginable problems. Yay quantum! New method enables quantum simulations on larger systems Phys.org - Science - U. Innsbruck – New method for characterizing multi-party states. That's one of the challenges (see subject above) of QC: know that your computer has been doing what it was supposed to do. Hey that's the experimentalists job augmented by the computer scientists approach.

FrenchWeb - Olivier Ezratty – Incredible attemp by a non scientist to explain what quantum computing and quantum communication are. In french.

Quanta Magazine - Stephanie Wehner – What to know why Quantum Information Science is not Computing only ? Read this! LIP6 is taking care of the upper network layers with other embers of the Paris node. https://www.youtube.com/watch?v=B76dFHnGdLM

TechXplore - U Innsbruck - Army Research Lab – Sending entanglement over long distances (50km) successfully is a huge achievement, because not only do you need to create the entanglement, but you also need to convert the created photon pairs to telecom wavelength!

Communications of the ACM - IQC / PI – A short overview of what quantum error correction is and why it is useful (well the statement that nothing interesting can be done without it is raising debates). Some more cool stuff on Surface codes in the Research Paper section, where D. Poulin has been constructing wormholes in them.

U. Sherbrooke - A. Krishna, D. Poulin – Having fun with toric codes, puncturing and stiching. It's a novel way to do fault tolerant computation using toric codes.

Matthias Christandl, Robert Koenig, Graeme Mitchison, Renato Renner, Approximations of the de Finetti theorem when there are finitely many systems – Not a recent one, but a good one.

Ben W. Reichardt, Falk Unger, Umesh Vazirani – Another important one for caracterizing geometric properties of entangled states… giving them some rigidity properties.

Submission deadline 2019-10-28 - Event on 2020-01-20/ – One day workshop around languages and tools for quantum computer coding.

Santa Fe Institute - Boston U – Use this whenever you need to explain what algorithm and optimization is.