Thank you! It was great visiting you last year!

Same!! And the journey was great thanks to you and all my new friends! Hope to see you more often at conferences.

Thanks so much!! It was amazing collaborating with you!

Check all my papers on arXiv: arxiv.org/a/son_j_2.html
The ones I covered in my thesis are: arxiv.org/abs/2209.15213, arxiv.org/abs/2303.13020, arxiv.org/abs/2403.09187, arxiv.org/abs/2412.04554, arxiv.org/abs/2412.06900

My next step hasn't been decided yet, and I will be staying at NTU until (at most) Feb-Apr 2026 to wrap up several projects. You may soon hear about Gaussian phase-covariant operations or hybrid resource theories from me:)

My interest in catalysts grew to include other auxiliaries, particularly memories. We introduced several quantum algorithms that approximately solve certain non-linear differential equations and showed that using quantum memories without reading them can drastically improve these algorithms.

We then observed an important caveat (catalysis is fragile to noise) and characterised rather general classes of theories where robust catalysis is possible/impossible.

Since I first encountered catalysis in QI, I've been fascinated by how powerful it can be despite it returning to its exact original state. My PhD study started there: we identified a source of its power (memory effects!) and found that this alone can bridge different thermodynamic paradigms.

Yayyyy the title survived!!

Years down the road, Jeongrak and I were trying to figure out whether robust catalytic advantage exists for thermal operations. We then realized that the conceptual key was hidden in those early, unannounced results by our friends all along!
arxiv.org/abs/2412.06900

Grover's algorithm is reinterpreted as a product formula approximation of imaginary-time evolution in a new paper.
@marekgluza.mathstodon.xyz.ap.brid.gy
@perp-waterfall.bsky.social
@nellynghy.bsky.social
@qzoeholmes.bsky.social
arxiv.org/abs/2507.15065

Finally, we show that quantum signal processing can be used to implement imaginary time evolution for unstructured search without post selection.

And this enables us to design a new `fixed-point' quantum search algorithm

i.e., a Grover type algorithm that never overshoots the solution

Check out this arXiv paper if you're interested!
arxiv.org/abs/2507.15065

3) We have since introduced many algorithms that are quantum recursions (check out a series of papers on double-bracket quantum algorithms). In particular, we think that double-bracket quantum imaginary-time evolution (arxiv.org/abs/2412.04554) is a strong candidate for QDP application.

2) We also compare the circuit size (depth x width) with or without QDP. Sometimes, QDP reduces the circuit size. However, even when it does not, QDP allows us to have circuit depth-width tradeoff, which I believe is quite cool.

1) We now focus on pure quantum recursions (i.e. the recursive non-linear evolution of a pure state), for which we have a better performance guarantee: the circuit depth can be exponentially reduced by using exponentially many initial copies of the state.

For those who have only read the arXiv v1, here are some summaries of the changes:

It took us over a year to publish this, since we went through numerous revisions including significant strengthening of the results. The screenshot below is an excerpt from our reply to referees.