During the review process we added the following result: Perfectly indistinguishable bosons maximize the Haar average of the generalized bunching probability.
Posts by Shawn Geller
Our paper on the bunching behavior of bosons was published in PRA today!
journals.aps.org/pra/abstract...
Ah yes that’s a simple criterion. I have been looking at lattice basis reduction algorithms so this was top of mind, haha
Asking because the picture refers to an ambient space
If that Z^3 is really a lattice in R^3, and someone only hands you 3 real vectors that are lattice basis vectors, how sure are you that you really are in Z^3?
Feel free to come say hi!
And I’ll be talking about randomized benchmarking with leakage
summit.aps.org/smt/2026/eve...
Tue. March 17, 8:24 — 8:36 a.m.
Mile High Ballroom 1C
Marcel Mazur will be talking about estimation of various properties of motional states in trapped ion processors:
summit.aps.org/smt/2026/eve...
Mon. March 16, 4:42 — 4:54 p.m.
Meeting Room 302
Come hear @akira.social talk about novel QECCs for hybrid systems
summit.aps.org/smt/2026/eve...
Mon. March 16, 12:48 — 1:00 p.m.
Mile High Ballroom 1E
I’ll be at the APS meeting this week, our group has a few presentations that I’m excited about.
Come hear Aliza Siddiqui talk about characterization of QEC cycles! summit.aps.org/smt/2026/eve..., Tue. March 17, 12:36 — 12:48 p.m. Mile High Ballroom 1C
P be a tennis player whose serve grazed the net.
Do you think that people understand classical physics?
I made a map of 3.4 million Bluesky users - see if you can find yourself!
bluesky-map.theo.io
I've seen some similar projects, but IMO this seems to better capture some of the fine-grained detail
problem set? i'm sorry but we do 21st century mathematics in this classroom. here's your problem category
I don’t know! Just thought your previous reply was a little hyperbolic haha
You don’t care about general Pauli channels, at least?
it’s okay james webb eventually finished
olde reed will always be dead tho
I think you basically always need both: the ability to churn through arithmetic, and the freedom to explore.
to go in in math, they’ll still need proficiency in applying algorithms, because you want to be able to quickly evaluate sub-problems when you’re working on things at a higher level.
and at the same time there are a lot of students that don’t care and will never go into math. They might still need proficiency in applying algorithms, because they’ll encounter arithmetic problems in their lives. Even for students that want
I feel like this comment is so complicated. In general, there’s always some deeper ideas lurking just beneath the surface of an algorithm, which are available for anyone who’s curious. I agree that people should be encouraged to try to understand at a deeper level through exploration,
This year's Quantum Computing Theory in Practice Conference (QCTiP) is scheduled for 04/20/2026-04/25/2026 in Oxford, UK 🇬🇧: qctipconf.github.io
Talk submission deadline is just round the corner: 01/11/2026. Looking forward to many exciting contributions and a great time in Hogwarts🪄, aehm Oxford🎓.
The promise of solving the electronic structure of FeMo-co has long been central to the narrative that quantum computers will one day solve world hunger. Now we can finally put the "solving world hunger" part to test since Garnet Chan just solved FeMo-co *classically*!
arxiv.org/abs/2601.04621
very physics-y though you might not like it
altland and simons is a standard condensed matter field theory textbook
i think quantum measurements are special because it is claimed that they are general enough to describe any way of learning about the world.