
Alexander Poremba
@aporemba_
Postdoctoral researcher @MIT_CSAIL working on quantum computation and cryptography.
ID: 2403246770
http://www.mit.edu/~poremba/ 22-03-2014 12:14:24
926 Tweet
1,1K Followers
1,1K Following


Randomness is essential to some research, but it’s always been prohibitively complicated to achieve. Now, we can use “pseudorandomness” instead. Webb Wright reports: quantamagazine.org/the-high-cost-…

With Jarrod McClean and Dar Gilboa, we prove a new quantum advantage for learning periodic neurons in the quantum statistical query model! arxiv.org/pdf/2503.20879 The hardness of this problem was studied long before this work by classical learning theorists. 🔎


Congratulations to Ewin Tang for developing classical analogs of quantum algorithms and for advances in quantum machine learning. breakthroughprize.org/News/91 UC Berkeley






Natalie Natalie Parham has some bold new ways of proving quantum circuit lower bounds, with fascinating connections to condensed matter physics and the natural proofs barrier from complexity theory. There are some really interesting questions to explore here.






Great new Quantum Index Report from Massachusetts Institute of Technology (MIT) and Accenture Live and open data online at the site below h/t Carl Dukatz



