Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.
Stabilizer codes and quantum error correction
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 2polarities
background 2representative citing papers
Lottery BP adds randomness to belief propagation decoding and uses syndrome voting to achieve far higher accuracy on topological quantum codes while reducing reliance on expensive global decoders.
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.
citing papers explorer
-
An algorithmic Polynomial Freiman-Ruzsa theorem
Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.
-
Lottery BP: Unlocking Quantum Error Decoding at Scale
Lottery BP adds randomness to belief propagation decoding and uses syndrome voting to achieve far higher accuracy on topological quantum codes while reducing reliance on expensive global decoders.
-
Architecture and protocols for all-photonic quantum repeaters
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.