@letonyo I suspect the same is also true for computing with qLDPC codes. The main problem with spacetime codes is that it is very hard to explore a very large search space of possible entanglement + measurement sequences.
Two more nice papers came out yesterday on logical measurements with stabiliser codes (although the first can in principle be generalised further): https://t.co/eRAAjh0n44, https://t.co/7AZUtH89yI. Very impressive how low the overhead for single logical qubit measurements is now.
Picturing Quantum Software is a brand new book covering state of the art methods in quantum compiling, circuit optimisation, classical simulation, and fault-tolerant quantum computing using the language of the ZX-calculus. Get the preprint for free: https://t.co/v1NouwVOoE
I forgot to post about it, but I recently put out a paper with open-source software for performing surgeries with qLDPC codes: https://t.co/gdJeSUmAiQ. Happily, there are two beautiful papers from today on a similar subject: https://t.co/Gs1M1nKI8E, https://t.co/WFOaIpnVbN.
There is a follow-up coming soon, where I apply the formalism to near-term qLDPC codes. This will come with open-source software to automate such surgeries.
Happy to announce that my paper with @fridaysimon has been published: https://t.co/ZNqsk5Urc5
Thanks to the anonymous reviewers and @CVuillot, whose feedback was invaluable.
My Masters student from last year, Samo, has put his thesis on arxiv: https://t.co/gyfeq1cwzR. It's a very patient and thorough ground-up description of qudit CSS codes. It also has a nice result on the logical spaces, which we believe to be novel (in quantum info anyway).