136 citations · 186 across the 12 of their papers we have counts for
15 papers
Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro García-Pintos +3
The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorith…
Positive co-degree density of hypergraphs
Anastasia Halfpap, Nathan Lemons, Cory Palmer
The \emph{minimum positive co-degree} of a non-empty -graph , denoted , is the maximum such that if is an -set contained in a hyperedge of $…
Mobility Map Inference from Thermal Modeling of a Building
Risul Islam, Andrey Lokhov, Nathan Lemons +1
We consider the problem of inferring the mobility map, which is the distribution of the building occupants at each timestamp, from the temperatures of the rooms. We also want to ex…
Maximum size intersecting families of bounded minimum positive co-degree
József Balogh, Nathan Lemons, Cory Palmer
Let be an -uniform hypergraph. The \emph{minimum positive co-degree} of , denoted by , is the minimum such that if is…
Induced and non-induced poset saturation problems
Balázs Keszegh, Nathan Lemons, Ryan R. Martin +2
A subfamily of sets is a non-induced (weak) copy of a poset in if there exists a bijection $i:P\rightarrow \ma…
Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
Vladyslav Oles, Nathan Lemons, Alexander Panchenko
Gromov-Hausdorff distances measure shape difference between the objects representable as compact metric spaces, e.g. point clouds, manifolds, or graphs. Computing any Gromov-Hausdo…