REVIEW 5 cited by
Topological Quantum Spin Glass Order and its realization in qLDPC 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
read the original abstract
Ordered phases of matter have close connections to computation. Two prominent examples are spin glass order, with wide-ranging applications in machine learning and optimization, and topological order, closely related to quantum error correction. Here, we introduce the concept of topological quantum spin glass (TQSG) order which marries these two notions, exhibiting both the complex energy landscapes of spin glasses, and the quantum memory and long-range entanglement characteristic of topologically ordered systems. Using techniques from coding theory and a quantum generalization of Gibbs state decompositions, we show that TQSG order is the low-temperature phase of various quantum LDPC codes on expander graphs, including hypergraph and balanced product codes. Our work introduces a topological analog of spin glasses that preserves quantum information, opening new avenues for both statistical mechanics and quantum computer science.
Forward citations
Cited by 5 Pith papers
-
Universal energy-space localization and stable quantum phases against time-dependent perturbations
For q-local Hamiltonians with bounded change, an initial eigenstate remains exponentially concentrated in a macroscopic energy window under arbitrary time-dependent perturbations.
-
Lifting Lifted Product Codes
Group-extension lifts systematically enlarge any LP code, transfer logical gadgets via chain maps (often with less surgery overhead), improve some code parameters, and give candidate thermodynamic families with cohere...
-
Stable valleys in the glassy landscape of a low-density parity-check (LDPC) code
For the Tanner-Hamming [7,4,3] LDPC model on a high-girth random regular graph, low-energy valleys separate canonical and microcanonical instability, yielding ensemble inequivalence in a non-random, unfrustrated spin glass.
-
Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization
Parity-aware BPE, which prioritizes the worst-compressed language at each merge, cuts cross-lingual tokenization inequality by up to 89% at negligible global cost.
-
Automorphism gadgets in homological product codes
Permutation automorphisms of input codes induce logical operations on homological product codes, implementable by physical qubit permutations plus a subsystem circuit, with effective distance preservation when permuta...
Discussion (0). Sign in to comment.