Pith. sign in

REVIEW 4 cited by

The Penrose Tiling is a Quantum Error-Correcting Code

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 2311.13040 v2 pith:UU4RUAZK submitted 2023-11-21 quant-ph cond-mat.mtrl-scihep-thmath-phmath.MGmath.MP

The Penrose Tiling is a Quantum Error-Correcting Code

classification quant-ph cond-mat.mtrl-scihep-thmath-phmath.MGmath.MP
keywords quantumcodeinformationtilingerror-correctingfinitematterpenrose
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The Penrose tiling (PT) is an intrinsically non-periodic way of tiling the plane, with many remarkable properties. A quantum error-correcting code (QECC) is a clever way of protecting quantum information from noise, by encoding the information with a sophisticated type of redundancy. Although PTs and QECCs might seem completely unrelated, in this paper we point out that PTs give rise to (or, in a sense, are) a remarkable new type of QECC. In this code, quantum information is encoded through quantum geometry, and any local errors or erasures in any finite region, no matter how large, may be diagnosed and corrected. We also construct variants of this code (based on the Ammann-Beenker and Fibonacci tilings) that can live on finite spatial tori, in discrete spin systems, or in an arbitrary number of spatial dimensions. We discuss connections to quantum computing, condensed matter physics, and quantum gravity.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Quantum error-correcting codes from aperiodic monotiles: the Hat and the Spectre

    quant-ph 2026-07 conditional novelty 6.0

    The Hat and Spectre aperiodic monotiles define erasure-correcting quantum codes with two local-indistinguishability sectors; under SE(2) the Hat retains a superselected chirality bit while the Spectre's label is gauged away.

  2. Quasi-Orthogonal Stabilizer Design for Efficient Quantum Error Suppression

    quant-ph 2026-04 unverdicted novelty 6.0

    Quasi-orthogonal stabilizer codes relax orthogonality constraints to achieve higher logical rates and up to two orders of magnitude better error suppression under depolarizing noise.

  3. A Superalgebra Within: representations of lightest standard model particles form a $\mathbb{Z}_2^5$-graded algebra

    hep-ph 2025-05 unverdicted novelty 5.0

    Representations of lightest Standard Model particles form a Z_2^5-graded superalgebra isomorphic to H_16(C) and generated by division algebras.

  4. Handbook of Error-Correcting Codes

    quant-ph 2026-06 unverdicted novelty 2.0

    The paper compiles a curated handbook reference of error-correcting codes, their symbol-based classifications, and interrelations with mathematical objects and physical phases.