Markus Heinrich

@markusheinrich.bsky.social

Quantum computing researcher at U Cologne | random quantum circuits | benchmarking and learning | Clifford group nerd

After 20 years, researchers finally have strong evidence that “quantum proofs” are more powerful than ordinary classical ones. The results suggest that at least in computation, there’s no way around the complexity of the quantum world. Read more in @quantamagazine.bsky.social:

Researchers Reveal the Power of ‘Quantum Proofs’ | Quanta Magazine

When checking that solutions to certain problems are correct, it turns out, you can’t get around the inherent complexity of the quantum world.

quantamagazine.org

I'm happy to share that our paper "Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits" is now published in PRX Quantum! Many thanks to Giulio, Filipa, and Juani for the great collaboration! journals.aps.org/prxquantum/a...

Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits

Strong and weak symmetry reductions render optimal stabilizer decompositions tractable for multiqubit unitaries beyond previous limits.

journals.aps.org

We are very happy to share that Grenoble will host TQC, one of the most important quantum computing conferences, in 2027! Excited to welcome the community in the heart of the Alpes! tqc-conference.org/2026/2027/

Bild

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

Bild

I just received a paper for a Springer journal that was obviously LLM-generated, complete with non-existent theorems, missing proofs, and hallucinated references. The journal has double-blind review. You see the problem? Stone thrown, hand hidden. No one to name-shame.

Are you a student or early-career researcher in quantum computing or quantum information? Then the following is for you. We're organising a focused, community-driven conference at Leibniz Universität Hannover, hosted by Prof. Robert Raussendorf. 🗓️ Save the date: August 27–29, 2025

Some statistical features of Haar unitaries can be well approximated in log depth, exponentially faster than previously thought. We give evidence that this is a 'truly quantum' effect by deriving linear lower bounds for orthogonal, Clifford, symplectic, matchgate groups scirate.com/arxiv/2506.2...

Will it glue? On short-depth designs beyond the unitary group

We provide a range of results on several groups of broad interest in quantum information science: the Clifford group, the orthogonal group, the unitary symplectic groups, and the matchgate group. For ...

scirate.com