Aaron Putterman

This paper presents a method to sparsify Quantum Cut Hamiltonians while preserving their energy.

The paper presents a resizable data structure for dynamic retrieval with O(1) time operations and space bound parameterized by the current size of the set.

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

This paper introduces and studies novel covers of hypergraphs, Abelian and Catalan covers, to capture dependences between hyperedges.