Nelly Ng
@nellynghy.bsky.social
Quantum information theorist. Lover of physics, math and good books.
Whether or not you're a fan of thermal operations, there's something fundamentally special about them: by pinning down what it means to equilibrate, thermal operations uniquely emerge! With this, we also uncover nice hierarchy of unital channels, in contrast with the classical Birkhoff theorem.
July 23, 2025 at 3:07 AM
Whether or not you're a fan of thermal operations, there's something fundamentally special about them: by pinning down what it means to equilibrate, thermal operations uniquely emerge! With this, we also uncover nice hierarchy of unital channels, in contrast with the classical Birkhoff theorem.
The culmination of a series of papers on DBQAs :)
Here's a new perspective on why Grover’s algorithm algorithm works:
Unstructured search can be written as ground state problem.
Then Grover's is just a product formula approximation of imaginary-time evolution
or, equivalently, a Riemannian gradient flow on SU(d)
to find this ground state.
Unstructured search can be written as ground state problem.
Then Grover's is just a product formula approximation of imaginary-time evolution
or, equivalently, a Riemannian gradient flow on SU(d)
to find this ground state.
July 22, 2025 at 3:50 PM
The culmination of a series of papers on DBQAs :)
Reposted by Nelly Ng
Our Grover preprint just popped up! (with Yudai Suzuki, @qzoeholmes.bsky.social, @marekgluza.mathstodon.xyz.ap.brid.gy, @nellynghy.bsky.social, @perp-waterfall.bsky.social)
Turns out… Grover's algorithm is secretly moonlighting as a first-order approximation to the imaginary time evolution!
Turns out… Grover's algorithm is secretly moonlighting as a first-order approximation to the imaginary time evolution!
July 22, 2025 at 7:50 AM
Our Grover preprint just popped up! (with Yudai Suzuki, @qzoeholmes.bsky.social, @marekgluza.mathstodon.xyz.ap.brid.gy, @nellynghy.bsky.social, @perp-waterfall.bsky.social)
Turns out… Grover's algorithm is secretly moonlighting as a first-order approximation to the imaginary time evolution!
Turns out… Grover's algorithm is secretly moonlighting as a first-order approximation to the imaginary time evolution!
Reposted by Nelly Ng
Today we posted a paper showing how a double-bracket quantum algorithm can implement quantum signal processing (DB-QSP), i.e., apply polynomial functions of operators to states.
Crucially our approach doesn't need any post-selection - but this comes at the expense of increased circuit depths.
Crucially our approach doesn't need any post-selection - but this comes at the expense of increased circuit depths.
April 3, 2025 at 5:16 PM
Today we posted a paper showing how a double-bracket quantum algorithm can implement quantum signal processing (DB-QSP), i.e., apply polynomial functions of operators to states.
Crucially our approach doesn't need any post-selection - but this comes at the expense of increased circuit depths.
Crucially our approach doesn't need any post-selection - but this comes at the expense of increased circuit depths.
We put out a systematic study on the extent of robust catalysis! This work was a wonderful experience for me, I hope you'll like it too. Check it out at scirate.com/arxiv/2412.0... !
December 11, 2024 at 8:48 AM
We put out a systematic study on the extent of robust catalysis! This work was a wonderful experience for me, I hope you'll like it too. Check it out at scirate.com/arxiv/2412.0... !