Pith. sign in

REVIEW 3 cited by

Universal fault-tolerant logic with heterogeneous holographic codes

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 2504.10386 v1 pith:5IWVDWWV submitted 2025-04-14 quant-ph hep-th

classification quant-phhep-th
keywords codesholographicquantumheterogeneousconcatenatedfault-tolerantuniversalcombination
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

The study of holographic bulk-boundary dualities has led to the construction of novel quantum error correcting codes. Although these codes have shed new light on conceptual aspects of these dualities, they have widely been believed to lack a crucial feature of practical quantum error correction: The ability to support universal fault-tolerant quantum logic. In this work, we introduce a new class of holographic codes that realize this feature. These heterogeneous holographic codes are constructed by combining two seed codes in a tensor network on an alternating hyperbolic tiling. We show how this construction generalizes previous strategies for fault tolerance in tree-type concatenated codes, allowing one to implement non-Clifford gates fault-tolerantly on the holographic boundary. We also demonstrate that these codes allow for high erasure thresholds under a suitable heterogeneous combination of specific seed codes. Compared to previous concatenated codes, heterogeneous holographic codes achieve large overhead savings in physical qubits, e.g., a $21.8\%$ reduction for a two-layer Steane/quantum Reed-Muller combination. Unlike standard concatenated codes, we establish that the new codes can encode more than a single logical qubit per code block by applying ``black hole'' deformations with tunable rate and distance, while possessing fully addressable, universal fault-tolerant gate sets. Therefore, our work strengthens the case for the utility of holographic quantum codes for practical quantum computing.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation

    quant-ph 2025-06 conditional novelty 8.0 of 10

    Blocklet concatenation yields fusion-based quantum computing protocols with constant-sized resource states, erasure thresholds up to 19.1%, and footprint per logical qubit scaling better than surface codes.

  2. Quantum codes from classical annealing

    quant-ph 2026-07 conditional novelty 6.0 of 10

    A simulated-annealing search over CSS and SWEL stabilizer codes finds moderate-length codes (n≤50) with distances at or above the quantum Gilbert-Varshamov bound, and publishes the resulting stabilizers.

  3. Growing Sparse Quantum Codes from a Seed

    quant-ph 2025-07 conditional novelty 6.0 of 10

    Conjoining only bit-flip and phase-flip repetition codes can generate any CSS code, and an iterative algorithm grows sparse subsystem codes with kd^2=O(n) worst-case scaling.

Pith tools