Pith. sign in

Encoding a qubit in an oscillator

4 Pith papers cite this work, alongside 1,210 external citations. Polarity classification is still indexing.

4 Pith papers citing it
1,210 external citations · external index

citation-role summary

background 1

citation-polarity summary

years

2026 3 2025 1

roles

background 1

polarities

background 1

representative citing papers

Boosting with List-Decodable Codes

stat.ML · 2026-07-07 · accept · novelty 8.0

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

math.CO · 2026-04-06 · unverdicted · novelty 8.0

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

quant-ph · 2026-06-05 · unverdicted · novelty 7.0

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

quant-ph · 2025-09-17 · unverdicted · novelty 5.0

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

Showing 4 of 4 citing papers.

  • Boosting with List-Decodable Codes stat.ML · 2026-07-07 · accept · none · ref 6

    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 math.CO · 2026-04-06 · unverdicted · none · ref 21

    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 quant-ph · 2026-06-05 · unverdicted · none · ref 8

    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 quant-ph · 2025-09-17 · unverdicted · none · ref 2

    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.