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.
Reposted by Alex Townsend-Teague
1/
🚀 Super excited to launch PlanqTN — an open-source Python lib + interactive web app for exploring quantum LEGO-based QEC codes!
🎥 Intro video: youtu.be/TNnE3hReYVk
🔗 GitHub: github.com/planqtn/plan...
🌐 Studio: planqtn.com
LinkedIn
This link will take you to a page that’s not on LinkedIn
lnkd.in
August 7, 2025 at 7:35 PM
New proof technique unlocked:
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
More fun footnotes in papers please! On 'copy cup' gates (scirate.com/arxiv/2410.1...):
March 28, 2025 at 1:48 AM
Reposted by Alex Townsend-Teague
Submissions for QCTiP 2025 are now open.
December 5, 2024 at 10:45 AM
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
Noice bit of whimsy from Hinze and Marsden: 'In addition to the ear, we meet two old acquaintances, the doughnut and the hourglass... and we get to know a new one, the “spiral.” All of them share the fate of the ears in that they collapse to the identity.'
December 4, 2024 at 7:59 AM
In the spirit of trying to use this thing properly, rather than just lurking like I did on TwiXer, a community I'd like to be more plugged into is people using memory systems for research (Anki, Mochi, etc, but for more than language learning or memorising capital cities). So I've made a list.
November 24, 2024 at 8:12 AM