Quantum complexity could solve a wormhole paradox
Physicsworld,
Physicists in Germany and the US have proved that the quantum complexity of random circuits grows linearly for extremely long…
Quantum Supremacy: A Guest Post by Abhinav Deshpande
Computational Complexity,
I am delighted to introduce youto Abhinav Deshpande, who is a graduate student at the University of Maryland, studying Quantum…
Recent papers by Susskind and Tao illustrate the long reach of computation
Shtetl-Optimized,
Most of the time, I’m a crabby, cantankerous ogre, whose only real passion in life is using this blog to shoot down the wrong…
Lucky 13 paper dance!
The Quantum Pontiff,
Having recently rediscovered arxiv.org/submit, I thought I’d mention a few papers to come out of team UW. Two particularly…