Optimal affine filtering measurements for group-covariant pure-state codewords reduce to an LP, and SPC-based affine-filtering+GE decoding can outperform symbol-wise USD and PGM on i.i.d. pure-state channels.
Fine-grained unambiguous measurements
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3representative citing papers
Locally-quantum decoding of LDPC codes under coherent bit-flip superpositions outperforms BP and sometimes Prange/SA on Gallager max-k-XORSAT, but an enhanced Prange algorithm ties it.
Extends NP-hardness of exceeding r/q + O(1/sqrt(D)) for bounded-degree max-Ek-LINSAT(q,r) over F_q and shows quantum decoding is required for DQI to achieve the hardness-optimal 1/sqrt(D) scaling.
citing papers explorer
-
Affine Filtering Measurements and Their Applications to Quantum Decoding
Optimal affine filtering measurements for group-covariant pure-state codewords reduce to an LP, and SPC-based affine-filtering+GE decoding can outperform symbol-wise USD and PGM on i.i.d. pure-state channels.
-
Optimization Using Locally-Quantum Decoders
Locally-quantum decoding of LDPC codes under coherent bit-flip superpositions outperforms BP and sometimes Prange/SA on Gallager max-k-XORSAT, but an enhanced Prange algorithm ties it.
-
Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry
Extends NP-hardness of exceeding r/q + O(1/sqrt(D)) for bounded-degree max-Ek-LINSAT(q,r) over F_q and shows quantum decoding is required for DQI to achieve the hardness-optimal 1/sqrt(D) scaling.