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
Universal fault-tolerant logic with heterogeneous holographic codes
read the original 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.
Forward citations
Cited by 3 Pith papers
-
Hyper-optimized Quantum Lego Contraction Schedules
A new Sparse Stabilizer Tensor cost function enables hyper-optimized contraction schedules for Quantum LEGO WEP calculations, delivering orders-of-magnitude improvements over dense tensor baselines for stabilizer codes.
-
Quantum codes from classical annealing
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.
-
Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation
New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDP...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.