Martin Larocca

New paper out!! 🥳😄 Last Friday we uploaded our latest preprint to the arXiv: "The commutant of fermionic Gaussian unitaries" Amazing collaboration with @TheImPolster @Nahuel_L_Diaz @MartinLaroo and @DiegoGM_quantum ! Thread 👇 arxiv.org/abs/2603.19210

Human insight is still a thing: over the last few years many computing resources were thrown towards the Merzon-Smirnov conjecture on maximal Schubert polynomials, including DeepMind's FunSearch. In the end it fell to a human-generated targeted check: arxiv.org/abs/2603.20104

A new hub for quantum computing 🏡 The Lab’s new Center for Quantum Computing, opening in downtown Los Alamos, unites dozens of quantum researchers under one roof to strengthen national security, advance quantum science and mentor the future workforce. 👉 ow.ly/sQi750Y8vVU

🎆As the year ends, I want to remind everyone that our summer school applications are open! Please apply/encourage your students to apply here: academicjobsonline.org/ajo/jobs/31108 We also have a handshake link too🤝 : app.joinhandshake.com/emp/jobs/10591… Shares appreciated!

LANL's 2026 Quantum Computing Summer School applications are now open. Please apply here 👇 academicjobsonline.org/ajo/jobs/31108

Theorists at @IBMResearch uncover a new quantum algorithm demonstrating a substantial speedup over the best classical methods—and showing what the process of algorithm discovery looks like. ibm.co/6011BzS05

@BraneRunner @IBMResearch Suggesting, irregardless of potential constant overheads, the quantum algorithm should be faster at not too large values of n (as a wild guess id say not more than two digits).

@IBMResearch What is the order of the symmetric group that would be needed for practical applications? Very large?

@BraneRunner @IBMResearch The quantum computation of diagonal kroneckers scales as ~n^k with k the tail of the partition, while the best (known) classical algorithm scales as ~n^{k^2}. This means that already for no too large k (e.g. 3 or 4) there is a huge polynomial gap.

@d1stinc8 @IBMResearch yeah but over non-abelian groups (e.g. the symmetric group) which is efficient but has found little succesful application so far.

@IBMResearch Is everything just a masked version of quantum Fourier transform?

Nice press release on our recent work on quantum algorithms for Kronecker, Littlewood, Kostka, Plethysm and other coefficients.

@grok @romaresearch @grok que instrumento se usa para un long en USD/ARS?

@grok @romaresearch @grok es decir el BNP habia apostado a peso debil y el peso se fortalecio, por eso el 8% de perdida?

ERA AGUANTARLO 2 SEMANAS MÁS LOS VELARON

6,100 neutral-atom qubits trapped in a grid by lasers @Caltech ... is a lot. caltech.edu/about/news/cal…

📢 QIP2026 Registration is OPEN! Join the leading global platform for quantum research! ✅ Early bird: until Dec 3, 2025 ✅ Late: Dec 4, 2025 – Jan 12, 2026 ℹ️ Details & registration ⬇️ 🔗 qip2026.lu.lv/registration/r… pic.twitter.com/VJqFm4qD3y

@MvsCerezo @qmisanz saludos a @qmisanz tambien!

@qmisanz Thanks for hosting me @qmisanz ! I had a blast chatting with all the amazing people in your group.

This week we had the pleasure of hosting @MvsCerezo in our group. We enjoyed tons of fun, engaging discussions, and progress on several projects. Looking forward to having you back soon! 🚀

@MvsCerezo at least this one is only two-dimensional

I find myself in a barren plateaud landscape. I've used Monument Valley so much as an analogy for BPs, that I figured I should finally pay this beautiful place a visit!

I am so, so happy to see this article published as a perspective in Nature Communications: nature.com/articles/s4146… More than the paper itself, I thoroughly enjoyed chatting with all my co-authors on the implications of the absence of BPs ~ classical simulability connection

@MvsCerezo @markwilde my bet was that you were using a contraction of widetilde

@markwilde It was a misspelled tilde hahaha

@markwilde randomly pops up in my overleaf 👀

We are thrilled to announce that QIP 2026 will take place in Riga, Latvia 🇱🇻  on January 24–30, 2026! 📢 The submissions are now open — join the world’s leading conference on quantum information processing. 🔗 Visit conference website for more information: qip2026.lu.lv