The surface code on the rhombic dodecahedron

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.06628 v1 pith:VHYGS2Q7 submitted 2020-10-13 quant-ph

Andrew J. Landahl This is my paper · ORCID

classification quant-ph

keywords codedodecahedronrhombicsurfacedescribedjauntylittlenon-css

verification ladder T0 review T1 audit T2 compute T3 formal

No signed human review yet.

0 comments

abstract

I present a jaunty little $[[14, 3, 3]]$ non-CSS surface code that can be described using a rhombic dodecahedron. Do with it what you will.

Forward citations

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

A small and interesting architecture for early fault-tolerant quantum computers
quant-ph 2025-07 conditional novelty 5.0 of 10

An early fault-tolerant quantum computer architecture that uses teleportation between the [[4,2,2]] and [[8,3,2]] color codes for a universal transversal gate set, plus a mirror-circuit benchmarking protocol.