Next up, David Sutter with a very interesting talk on "Quantum Brascamp-Lieb dualities". #BIID8

Happy to share a new quantum algorithm to solve convex dynamic programming problems with a quadratic speedup. Joint work with Giacomo-@sutter_tobias-Stefan from IBM Research/EPFL (see arxiv.org/abs/2011.11654)

Error mitigation techniques may allow a smooth transition into the fault-tolerant computing era. Together with Christophe and Stefan from IBM Research and ETH Physics we improve the sampling overhead for the quasiprobability method arxiv.org/abs/2101.09290

When we first derived error mitigation we tried to make it clear it was not error correction. Since then I have wanted to bring them together and in this work we start to close the gap. Still a long way to go but I really like this direction of research arxiv.org/abs/2103.04915

Our work on "The power of quantum neural networks" has been published in Nature Computational Science! A huge thanks to the coauthors, David Sutter Alessio Figalli Aurelien Lucchi Christa Zoufal and Stefan Woerner. Hard work pays off! 🙂 nature.com/natcomputsci/v…

Check out the recent IBM blog post research.ibm.com/blog/quantum-n… about our recent paper on the power of quantum neural networks [joint work with Amira Abbas, C. Zoufal, Aurelien Lucchi, Alessio Figalli, S. Woerner]

I'm at #iccmp2021 today to receive the 2019 AHP prize awarded jointly with my co-authors Ralph Silva and Jonathan Oppenheim for arxiv.org/ct?url=https%3…. I wish they could be there. Nice to see David Sutter (AHP prize 2018) and J. Bauch (AHP prize 2017) in person again!

Happy to finally get this paper published and looking forward to seeing more results that bring error mitigation and correction together. David Sutter journals.aps.org/prl/abstract/1…

New arXiv paper out! Purely classical machine learning :) in collaboration with David Sutter Alessio Figalli and Stefan Woerner. We define and motivate a measure of capacity for ML models: the local effective dimension. We show how this quantity bounds generalization error 1/3

How hard is it to train a quantum support vector machine? --> check out arxiv.org/abs/2203.00031 (joint work with Gian Gentinetta, Arne, and Stefan

How does entropy accumulate? Check out our recent generalization of the EAT arxiv.org/abs/2203.04989 [joint work with Tony, Omar, and Renato]

In recognition of his contributions to mathematical physics, Jürg Fröhlich of ETH Zurich is being inducted into the National Academy of Sciences. Watch the #NAS159 livestream: ow.ly/uuXh50IVNP2

Does classical communication between (small) quantum computers help to run large computations? We show it does. Check out arxiv.org/abs/2205.00016

IBM blogpost about our recent work on circuit knitting research.ibm.com/blog/circuit-k…

Which of the two cuts below (dotted red vs dashed blue) is better? And what are the optimal costs? --> check out arxiv.org/abs/2302.03366

There is something mesmerising about seeing one's paper(s) completely plagiarised, theorem by theorem, without any reference, and posted on arXiv. Compare arxiv.org/abs/2010.02152 with our arxiv.org/abs/1604.03023

We finally understand how to (optimally) cut arbitrary two-qubit gates. Two interesting findings: (1) cutting multiple gates jointly is always cheaper than cutting them individually (2) classical communication does not help ---> check out arxiv.org/abs/2312.11638

Follow up work on the effective dimension (with M. Datres, GP. Leonardi, Alessio Figalli): (i) stronger generalization bound (ii) lower bound that can be computed efficiently (for Markovian models) (iii) new simulation results --> check out arxiv.org/abs/2401.09184

on bluesky now as `quantum-sutter`

Uhlmann's theorem states that the fidelity of two states rho and sigma can be expressed in terms of their purifications (where the fidelity simplifies). In arxiv.org/abs/2502.01749 we (with Giulia Mazzola and Renato Renner) generalize Uhlmann's theorem to Rényi relative entropies.