Advertisement · 728 × 90

Posts by Alex Townsend-Teague

LinkedIn This link will take you to a page that’s not on LinkedIn

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

8 months ago 10 5 1 0

Handy for controlled gates and diagonal non-Clifford stuff

9 months ago 0 0 0 0
Post image

Add another regular Hadamard to the three legged one to get an AND gate on computational basis states:

9 months ago 1 0 1 0
Post image

In general it's this bunch of symbols:

9 months ago 0 0 1 0
Post image

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.:

9 months ago 1 0 1 0
Post image

Or we could all use the ZX-calculus!

9 months ago 4 0 1 0
Post image

Cinema-goers agree that the proof technique is unsatisfying:

11 months ago 2 0 0 0
Advertisement

From Aluffi's 'Algebra: Chapter 0'.

11 months ago 0 0 0 0
Post image

New proof technique unlocked:

11 months ago 10 0 2 0
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.

Section 3 of the Extractor paper is a very good overview I find as a non-expert. arxiv.org/abs/2503.10390

1 year ago 8 2 0 0
Footnote from a paper: "Not to be confused with 'copy cat' or 'coffee cup'"

Footnote from a paper: "Not to be confused with 'copy cat' or 'coffee cup'"

More fun footnotes in papers please! On 'copy cup' gates (scirate.com/arxiv/2410.1...):

1 year ago 9 1 0 0

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!

1 year ago 2 0 0 0
Preview
Localized statistics decoding: A parallel decoding algorithm for quantum low-density parity-check codes Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code. However, the lack of a practical ...

Localised statistics decoding? arxiv.org/abs/2406.18655

1 year ago 2 0 0 0

News to me - this must be a rival to QCTiP in the similar but unrelated field of quanthm info?

1 year ago 1 0 1 0
Advertisement
Post image

Submissions for QCTiP 2025 are now open.

1 year ago 23 15 1 2

Anyone want to collaborate on making a @typst.app template for @quantum-journal.org?

1 year ago 14 2 2 0

From "Introducing String Diagrams: The Art of Category Theory" - helluva book.

1 year ago 2 0 0 0

'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...'

1 year ago 2 0 1 0
Post image

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.'

1 year ago 7 0 1 0

Me neither! I'm just curious to know who else is on the team atm. Have added you to the list.

1 year ago 0 0 0 0

Link to list: bsky.app/profile/did:...

1 year ago 0 0 1 0

In any case, if you're reading this as a memory-systems-for-research user and want to be added, reply below!

1 year ago 0 0 1 0

...perhaps there's already such a list/starter pack and I couldn't find it, or an online community already hanging out somewhere?

1 year ago 0 0 1 0

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...

1 year ago 0 0 1 0
Advertisement

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.

1 year ago 5 1 1 0
Post image

Alternatively: the ZX-calculus representation is the best way of depicting surface codes (arxiv.org/abs/2204.14038)

1 year ago 3 0 0 0