12 citations · 14 across the 6 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.CR2026
Pinpointing Super-Quadratic Quantum Enumeration Speedups: Exact and Certified Evaluation of the Guessing-Moment Exponent under Product-Distribution Advice
Carsten Schubert, Niklas Paskarbeit, Maximilian J. Kramer +2
Grover's algorithm gives an optimal quadratic query advantage for black-box search. In cryptanalysis, however, the search often comes with additional probabilistic advice over the…
quant-ph2026
Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry
Maximilian J. Kramer, Carsten Schubert, Jens Eisert
For general max-k-XORSAT with , no polynomial-time algorithm can do substantially better than random guessing on worst-case instances unless : a…
quant-ph2026
Tight inapproximability of max-LINSAT and implications for decoded quantum interferometry
Maximilian J. Kramer, Carsten Schubert, Jens Eisert
We establish tight inapproximability bounds for max-LINSAT, the problem of maximizing the number of satisfied linear constraints over the finite field , where each co…