The list of accepted talks for the QEC conference is out: https://t.co/JWjl6Zc6GX
That will be a super exciting conference. Don't miss it!
Our work with Gilles Zémor was accepted for a talk.
I also want to advertise a recent result by Bergamaschi and Gidney that shows constant space overhead quantum computation can be accomplished with the connectivity of a line (2502.16132). 10/10
Happy to share that some previous work with @krishnanirudh and @preskill that we call hierarchical codes (2303.04798) was recently published in Quantum! 1/10
These sorts of constructions also have good resilience against rare error bursts as long as they are sufficiently spatially localized, so we may see additional reasons to use them as we understand our error sources better. 9/10
There are 3 types of QIP submissions:
Type I: Submitted Friday
Type II: Submitted Friday AOE
Type III: Anything not Type I or Type II. I'm not sure these exist
We think that it's practical, but there's further optimizations to be done. Some neat takeaways: 1) we should be coding for fault-tolerance and for the network separately. 2) post-selection can be made constant-rate using the concatenation trick of Yamasaki and Koashi. 8/8
Suppose that we want to build a large-scale fault-tolerant quantum computer. Regardless of the size of our individual quantum computers, we will eventually want to link quantum computers together to assemble a larger quantum computer. 1/8
In most regimes, if you have the memory to spare, this is better than other methods like lattice surgery using physical-level Bell pairs. Our methods are lightweight enough, that if we don't have the memory to spare (in units of logical qubits), we are probably in trouble. 7/8