Hat tip to Aniket Das on twitter, where I saw this... x.com/ketd47

Hear hear!

I do not, I'm afraid. I guess it's space efficiency vs time efficiency vs pedagogy; perhaps an expert can chip in...

I do phase estimation without QFT in my undergrad course. youtu.be/CMqPutlG59c?...

It's just Hadamard test plus binary search.

This paper looks incredible, by the way.

J-Live's Braggin' Writes has my top 'thesis' verse, though. ("I displays my credentials over instrumentals...")

This!

I like to say,

"Let p|A denote distribution p conditioned on event A.

Imagine a world where the laws of probability are the same, except (p|A)|B need not equal (p|B)|A.

Except you don't have to imagine, because it's literally our world!

Now explore probabilistic algorithms in this world."

There's a reason I called it Quantum Computer Programming in 100 Easy Lessons.

Meming aside, this looks like a cool paper...

I did not know this!

Also Aayush Jain!

[...] "x1 += x2" and "x1 += x3". Similarly for "x2 -= x4".

Finally, we posit: Doing "x1 += x2" 256 times in a row is equivalent to doing nothing
(maybe shoulda called it "x1 += x2 mod 256")
and sim. for doing "x2 += x3", "x3 += x4" 256x in a row.

Can you prove "x1 -= x3" commutes with "x2 -= x4"?