12 citations · 14 across the 6 of their papers we have counts for
6 papers
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…
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…
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…
Boundary systems and (skew-)self-adjoint operators on infinite metric graphs
Carsten Schubert, Christian Seifert, Jürgen Voigt +1
We generalize the notion of Lagrangian subspaces to self-orthogonal subspaces with respect to a (skew-)symmetric form, thus characterizing (skew-)self-adjoint and unitary operators…
Localization for quantum graphs with a random potential
Carsten Schubert
We prove spectral localization for infinite metric graphs with a self-adjoint Laplace operator and a random potential. To do so we adapt the multiscale analysis (MSA) from the R^d-…
Unbounded quantum graphs with unbounded boundary conditions
Daniel Lenz, Carsten Schubert, Ivan Veselić
We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such g…