A new boosting algorithm uses list-decodable codes to reduce weak-learner calls from O(log(1/ε)/γ²) to O(log(1/ε)) for XOR-closed concept classes.
Encoding a qubit in an oscillator
4 Pith papers cite this work, alongside 1,210 external citations. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.
A reduction from weak agnostic learning of class C to efficient tomography of states with bounded l1-extent w.r.t. C, with a concrete algorithm for stabilizer states running in poly(n, (ξ/ε)^log(ξ/ε)) time.
DQI resists classical simulation by locating high-probability outputs but is simulable at a low level of the polynomial hierarchy, constructively solves a MacWilliams-based coding bound, and corresponds to low-energy states of a quantum harmonic oscillator.
citing papers explorer
-
Boosting with List-Decodable Codes
A new boosting algorithm uses list-decodable codes to reduce weak-learner calls from O(log(1/ε)/γ²) to O(log(1/ε)) for XOR-closed concept classes.
-
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.
-
Tomography of quantum states with bounded extent
A reduction from weak agnostic learning of class C to efficient tomography of states with bounded l1-extent w.r.t. C, with a concrete algorithm for stabilizer states running in poly(n, (ξ/ε)^log(ξ/ε)) time.
-
On the Complexity of Decoded Quantum Interferometry
DQI resists classical simulation by locating high-probability outputs but is simulable at a low level of the polynomial hierarchy, constructively solves a MacWilliams-based coding bound, and corresponds to low-energy states of a quantum harmonic oscillator.