Alex Townsend-Teague
townsend-teague.bsky.social
Alex Townsend-Teague
@townsend-teague.bsky.social
Working on quantum error correction. Interested in maths, coding and spaced repetition. PhD student at Freie Universität Berlin.
Handy for controlled gates and diagonal non-Clifford stuff
July 10, 2025 at 10:42 PM
Add another regular Hadamard to the three legged one to get an AND gate on computational basis states:
July 10, 2025 at 10:42 PM
In general it's this bunch of symbols:
July 10, 2025 at 10:42 PM
Yeah I'm mostly joking, I agree with providing circuit diagrams - but if you're having to make up new notation anyway...

Hadamard box is "all ones matrix except for the bottom corner", e.g.:
July 10, 2025 at 10:40 PM
Or we could all use the ZX-calculus!
July 10, 2025 at 6:27 PM
Cinema-goers agree that the proof technique is unsatisfying:
April 25, 2025 at 8:16 AM
From Aluffi's 'Algebra: Chapter 0'.
April 25, 2025 at 6:58 AM
Reposted by Alex Townsend-Teague
Section 3 of the Extractor paper is a very good overview I find as a non-expert. arxiv.org/abs/2503.10390
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation
In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LPDC) codes have been established as promising candidates for low-overhead memory when compared to conventional approaches based on surface codes. Performing fault-tolerant logical computation on QLDPC memory, however, has been a long standing challenge in theory and in practice. In this work, we propose a new primitive, which we call an $\textit{extractor system}$, that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation. In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle, consisting of $O(d)$ physical syndrome measurement cycles, without rearranging qubit connectivity. We further propose a fixed-connectivity, LDPC architecture built by connecting many extractor-augmented computational (EAC) blocks with bridge systems. When combined with any user-defined source of high fidelity $|T\rangle$ states, our architecture can implement universal quantum circuits via parallel logical measurements, such that all single-block Clifford gates are compiled away. The size of an extractor on an $n$ qubit code is $\tilde{O}(n)$, where the precise overhead has immense room for practical optimizations.
arxiv.org
April 7, 2025 at 4:09 PM
I recently read Schönhauser Allee by Wladimir Kaminer. It's a bunch of funny little vignettes (modulo your definition of funny) of life in Berlin. Each one is 5 or so pages long, simple language, and there's no real plot to remember. I recommend it!
December 24, 2024 at 3:19 PM
News to me - this must be a rival to QCTiP in the similar but unrelated field of quanthm info?
December 5, 2024 at 8:55 PM
Reposted by Alex Townsend-Teague
Anyone want to collaborate on making a @typst.app template for @quantum-journal.org?
December 4, 2024 at 7:45 AM
From "Introducing String Diagrams: The Art of Category Theory" - helluva book.
December 4, 2024 at 7:59 AM
'We have already conducted the proofs for the shapes in the first row, using two pops for the doughnuts and two snaps for the hourglasses. For the ears, we combine a snap with a pop...'
December 4, 2024 at 7:59 AM
Me neither! I'm just curious to know who else is on the team atm. Have added you to the list.
November 26, 2024 at 8:39 AM
November 24, 2024 at 8:14 AM
In any case, if you're reading this as a memory-systems-for-research user and want to be added, reply below!
November 24, 2024 at 8:13 AM
...perhaps there's already such a list/starter pack and I couldn't find it, or an online community already hanging out somewhere?
November 24, 2024 at 8:12 AM
For now I've just added a couple of friends from my research group who I hope won't mind being added. Feels impolite to add others against their will, but perhaps one of the GOATs @michaelnielsen.bsky.social or @andymatuschak.org would be interested in promoting this list (and being on it!). Or...
November 24, 2024 at 8:12 AM