Really happy to see the qubit number gap in the LU-LC Conjecture closed. Congratulations Nathan Claudet!

The meme is a Mr. McMahon reaction. First panel: LU=LC for circle graph states Second panel: Circle graphs are vertex-minors of bipartite circle graphs Third panel: Bipartite circle graph states are just planar code states Fourth and final panel: MBQC on circle graph states is efficiently classically simulable Context: Circle graph states are graph states whose underlying graphs are intersection graphs of chords of a circle. Their entanglement is a priori high enough to be candidates for universal measurement-based quantum compu- tation (MBQC), yet MBQC on circle graph states turns out to be efficiently classically simulable. We prove that for circle graph states, local unitary (LU) equivalence reduces to the efficiently decidable local Clifford (LC) equivalence. We further establish a one-to-one correspondence between bipartite circle graph states and planar code states, and use it to give a new proof that MBQC on circle graph states is efficiently classically simulable. Finally, we show that counting the number of graph states LU-equivalent to a given graph state is #P-hard, even when restricted to circle graph states.

@dulwichquantum.bsky.social
My first meme abstract!

The full paper: arxiv.org/abs/2603.08847

Thank you Rose McCarty, Hendrik Poulsen Nautrup and Nathan Claudet for this fun collaboration :)

2026 Quantum papers! Congratulations Quantum community! It’s hard to believe 10 years have passed and we’re en route to our 10-year founding anniversary in April 2026. On that occasion we wanted to announce ...

Celebrate with us Quantum's approaching 10 year anniversary in 2026 with the publication of the 2026th paper! Do you know which paper that is?
quantum-journal.org/2026-quantum...

I am surprised to see this and hope the arXiv stays nonprofit.

What is next in quantum advantage? We are now at an exciting point in our process of developing quantum computers and understanding their computational power: It has been demonstrated that quantum computers can outperform classical …

In the last post of a 3-part series, Dominik Hangleiter highlights the importance of efficient verification of quantum advantage, and assesses the prospects for achieving it soon.
quantumfrontiers.com/2026/02/28/w...

Has quantum advantage been achieved? Part 2: Considering the evidence Welcome back to: Has quantum advantage been achieved? In Part 1 of this mini-series on quantum advantage demonstrations, I told you about the idea of random circuit sampling (RCS) and the experimen…

In part 2 or a 3-part series, Dominik Hangleiter continues his thoughtful assessment of the evidence for quantum advantage in random-circuit-sampling experiments.
quantumfrontiers.com/2026/01/25/h...

The computational two-way quantum capacity Quantum channel capacities are fundamental to quantum information theory. Their definition, however, does not limit the computational resources of sender and receiver. In this work, we initiate the st...

Last year, I became interested in the question what happens if we impose computational efficiency onto information theory. In our latest paper, we analyze how this changes the amount of information that can be transmitted over a channel -- spoiler alert: a lot! scirate.com/arxiv/2601.1...

100% agree. Especially since we have author IDs that are matched to the papers when they are claimed!

Our introductory webinar is now open for registration!

ℹ️ Quantum Internet Use Cases: Overview and Status
🎤 Michele Amoretti | QIA Use Case Team Lead and Director of Quantum Software Laboratory at University of Parma
📅 11 February 2026, 15:00-15:30 CET
🔗 meet.zoho.eu/ssbb-fvm-xzm

Sign up today!

Has quantum advantage been achieved? Recently, I gave a couple of perspective talks on quantum advantage, one at the annual retreat of the CIQC and one at a recent KITP programme. I started off by polling the audience on who believed …

Dominik Hangleiter weighs in with an informative post about a much debated question: Has quantum advantage been achieved? This is the first post in a three-part series.
quantumfrontiers.com/2026/01/06/h...

Herzlichen Glückwunsch!

The largest fundamental science agency in Europe will save €1.4 million annually by breaking free from Clavariate Analytics' huge databases of references and citations.

"We have worked for free to lock ourselves collectively into a paid system", one head of the CNRS explains - but no more! 🎉

This comment has a strong guns-don't-kill-people vibe.

PhD position on quantum computing at at ETH Zurich, advised by Dominik Hangleiter and co-advised by Renato Renner

www.quantiki.org/position/phd...

Congratulations!

I don't know, but your question made me think of this Goethe quote:

"Alles Gescheite ist schon gedacht worden, man muss nur versuchen, es noch einmal zu denken." - "Everything sensible has already been thought of; one just has to try to think it again."

Are new ideas better than old ones?

Isn't the point of the figure more that there is no guarantee that post quantum protocols cannot be broken by either algorithmic discoveries or progress in hardware development?
Perhaps the inclination of the blue line segments is exaggerated, but the important point is that they are not horizontal.

Sounds like the papers are writing themselves on time then!

🥳I am very happy to have been awarded an ERC Starting Grant that I will use to start my own group and explore the large-scale entanglement properties of complex quantum systems.

This would not have been possible without my fantastic collaborators and supervisors. A big "thank you" to all of you! 🙏

This gets even worse when translating between languages with a dictionary 👀

... and teleport him to the dark side of the moon!

I did not expect to learn the difference between eudaimonia and eudaemonia, when I decided to participate in the www.avibagla.com/blueskydicti... challenge today 😅

en.wikipedia.org/wiki/Eudaimo...
en.wikipedia.org/wiki/Eudaemo...

ChatGPT and the Meaning of Life: Guest Post by Harvey Lederman Scott Aaronson’s Brief Foreword: Harvey Lederman is a distinguished analytic philosopher who moved from Princeton to UT Austin a few years ago. Since his arrival, he’s become one of my …

I wrote about automation and the meaning of life, as a guest post on Scott Aaronson's Shtetl-Optimized. (1/5)

scottaaronson.blog?p=9030

Looks like a rather deceptive advance to me.

QIP2025

#Quantum #QIP2025
The team @qip2025.bsky.social has uploaded the QIPv2025 talks

www.youtube.com/@QIP2025

Enjoy rewatching your favorites!

Ich bin auch dafür Veröffentlichungen wieder auf Deutsch zu schreiben 🤓

(I'm also in favor of going back to German for writing papers 🤓)

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

Understanding Quantum Information and Computation This is a course on the theory of quantum computing. It consists of 16 lessons, each with a video and written component, covering the basics of quantum information, quantum algorithms (including query...

After 3 1/2 years of work my course on quantum computing is finally finished — the "Director's Cut" of Understanding Quantum Information and Computation is now available.

arxiv.org/abs/2507.11536

🕵️ Want to blow the whistle without risking your safety?

Today, true anonymity online doesn’t exist. But in the future, #QuantumInternet could make it possible.

🎥 Learn how Quantum Whistleblowing works in episode 2 of #EverydayQuantum.