329 citations · 671 across the 10 of their papers we have counts for
12 papers
Permutation Wordle
Samuel Kutin, Lawren Smithline, Vincent Vatter
We introduce a guessing game, ``Permutation Wordle,'' in which a guesser attempts to recover a setter's hidden permutation of the set . In each round, the guesser…
Permutation Wordle
Samuel A. Kutin, Lawren M. Smithline
We introduce a guessing game, permutation Wordle, in which a guesser attempts to recover a hidden permutation in . In each round, the guesser guesses a permutation (using info…
The Promise Polynomial Hierarchy
Adam Chalcraft, Samuel Kutin, David Petrie Moulton
The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to in…
Almost-everywhere algorithmic stability and generalization error
Samuel Kutin, Partha Niyogi
We explore in some detail the notion of algorithmic stability as a viable framework for analyzing the generalization error of learning algorithms. We introduce the new notion of tr…
Efficient Distributed Quantum Computing
Robert Beals, Stephen Brierley, Oliver Gray +5
We provide algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic mo…
Quantum interpolation of polynomials
Daniel M. Kane, Samuel A. Kutin
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we…