Advertisement · 728 × 90

Posts by Shawn Geller

During the review process we added the following result: Perfectly indistinguishable bosons maximize the Haar average of the generalized bunching probability.

1 week ago 0 0 0 0
Measuring multiparticle indistinguishability with the generalized bunching probability The indistinguishability of many bosons undergoing passive linear transformations followed by number basis measurements is fully characterized by the visible state of the bosons. However, measuring all the parameters in the visible state is experimentally demanding. In this work, we seek to perform partial characterization of the visible state by measuring properties of it that are available after randomization. First, we study the case where the occupied visible modes are randomly permuted, and second, we study the case where Haar random linear optical unitaries are applied. In each case, we find that the generalized bunching probability---which is the probability that all the input bosons arrive in a given subset of the output modes---obeys monotonicity with respect to some partial order of distinguishability of the input bosons. As an intermediate result, we show that Lieb's permanental-dominance conjecture for immanants is equivalent to the following statement: for states that are invariant under permutations of the occupied visible modes, the generalized bunching probability is maximized when the bosons are perfectly indistinguishable. We also prove that a consequence of the monotonicity of the generalized bunching probability after Haar averaging is that this average is maximized when the bosons are perfectly indistinguishable. Finally, we discuss applications of our results to thermometry of cold-atom systems.

Our paper on the bunching behavior of bosons was published in PRA today!

journals.aps.org/pra/abstract...

1 week ago 3 0 1 0

Ah yes that’s a simple criterion. I have been looking at lattice basis reduction algorithms so this was top of mind, haha

2 weeks ago 1 0 0 0

Asking because the picture refers to an ambient space

2 weeks ago 1 0 1 0

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?

2 weeks ago 1 0 1 0

#MarchMeeting26

1 month ago 1 0 0 0

#APSsummit26

1 month ago 1 0 1 0
Advertisement

Feel free to come say hi!

1 month ago 1 1 1 0
Measuring Leakage Rates using Randomized Benchmarking | APS Meeting Leakage errors are those that move the state out of the computational subspace. It has been shown that an adaptation of randomized benchmarking can be used to simultaneously infer bounds on the logica...

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

1 month ago 1 0 1 0
Improving Estimation of Fock Probabilities And Parity of Trapped Ion Motional States | APS Meeting The motions of trapped ions can be used for quantum information protocols, and researchers are manipulating these motional states with increasing fidelity and complexity. In this work, we study the es...

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

1 month ago 1 0 1 0
Hybrid stabilizer quantum error correction on abelian configuration spaces | APS Meeting Experimental platforms routinely access Hilbert spaces far beyond qubit subspaces, including harmonic-oscillator (bosonic) and rotor modes that mediate gates or anharmonic modes providing effective lo...

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

1 month ago 1 0 1 1
A Diary of a Faulty Logical Qubit: Logical Gate Set Tomography | APS Meeting The quantum characterization, verification, and validation (QCVV) toolbox assesses processor performance by analyzing their qubits and logic operations. One can construct a comprehensive model of quan...

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

1 month ago 2 0 1 0

P be a tennis player whose serve grazed the net.

2 months ago 2 0 1 0

Do you think that people understand classical physics?

2 months ago 1 0 1 0
Preview
Bluesky Map Interactive map of 3.4 million Bluesky users, visualised by their follower pattern.

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

2 months ago 7238 2166 660 4554

problem set? i'm sorry but we do 21st century mathematics in this classroom. here's your problem category

2 months ago 41 7 4 2
Advertisement

I don’t know! Just thought your previous reply was a little hyperbolic haha

2 months ago 1 0 1 0

You don’t care about general Pauli channels, at least?

2 months ago 0 0 1 0

it’s okay james webb eventually finished

2 months ago 1 0 1 0

olde reed will always be dead tho

2 months ago 1 0 1 0

I think you basically always need both: the ability to churn through arithmetic, and the freedom to explore.

3 months ago 0 0 0 0

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.

3 months ago 0 0 1 0

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

3 months ago 0 0 1 0
Advertisement

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,

3 months ago 0 0 1 0
Post image

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🎓.

3 months ago 18 10 1 0
Preview
Classical solution of the FeMo-cofactor model to chemical accuracy and its implications The main source of reduced nitrogen for living things comes from nitrogenase, which converts N2 to NH3 at the FeMo-cofactor (FeMo-co). Because of its role in supporting life, the uncertainty surroundi...

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

3 months ago 31 5 0 4

very physics-y though you might not like it

3 months ago 2 0 0 0

altland and simons is a standard condensed matter field theory textbook

3 months ago 1 0 1 0

i think quantum measurements are special because it is claimed that they are general enough to describe any way of learning about the world.

3 months ago 1 0 1 0