@TomGur gives the highlights of our joint work with @Qsrinivasan_1, @abgrilo, and @IgorCarboniOliv showing that designing quantum learning algorithms for some problems (even sub-exponential ones) will have significant consequences for complexity theory (circuit lower bounds)!
Quantum learning algorithms imply circuit lower bounds!
I’m very excited about this joint work with @Qsrinivasan_1
,@abgrilo, Igor Oliveira, and Aarthi Sundaram:
https://t.co/ieWUcHUSyr
So what is it all about? 1/3
If you enjoyed #TQC2019 at @UofMaryland and would like your organization to host it in 2021, proposals are now being accepted! For details, see the Call for Proposals at https://t.co/9AqwfqwsOq (Deadline Nov 15, 2019).
A very interesting set of talks to be featured at #QIP2020. It was such a privilege to have served on the PC for QIP this year. An eye-opening experience on so many levels giving a bird's eye view of all the great theoretical #quantum info & computing results of the year!
It turns out this is the story of how a mathematical puzzle from 1902 led to the defeat of Hitler.
It’s really surprisingly less tenuous than you’d expect from that description. There’s a well-documented chain of events leading from one to the other.
From personal experience, an absolutely great postdoctoral program with the chance to interact with experts across the quantum {information, cryptography, computing} spectrum and numerous opportunities for advancement in your research journey!
Excited to do my part & put #QuantumComputing on the map at the Grace Hopper Celebration 2019 #GHC19: Speaking on 4th Oct about our recent result (with @abgrilo and @Sriniva66739542) on the Quantum hardness of learning shallow circuits! https://t.co/aRHnsm5kdP