research
∙
01/11/2023
Synergies Between Operations Research and Quantum Information Science
This article highlights synergies between quantum information science (Q...
share
research
∙
06/16/2022
An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
We resolve the approximability of the maximum energy of the Quantum Max ...
research
∙
06/01/2022
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut
We investigate the space complexity of two graph streaming problems: Max...
research
∙
11/01/2021
Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality
The Gaussian noise stability of a function f:ℝ^n →{-1, 1} is the expecte...
research
∙
10/30/2021
On Small-Depth Tree Augmentations
We study the Weighted Tree Augmentation Problem for general link costs. ...
research
∙
08/27/2021
An explicit vector algorithm for high-girth MaxCut
We give an approximation algorithm for MaxCut and provide guarantees on ...
research
∙
07/27/2021
Neuromorphic scaling advantages for energy-efficient random walk computation
Computing stands to be radically improved by neuromorphic computing (NMC...
research
∙
05/12/2021
Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms
The Lasserre Hierarchy is a set of semidefinite programs which yield inc...
research
∙
06/25/2020
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication
Boolean circuits of McCulloch-Pitts threshold gates are a classic model ...
research
∙
04/07/2020
Probing a Set of Trajectories to Maximize Captured Information
We study a trajectory analysis problem we call the Trajectory Capture Pr...
research
∙
09/19/2019
Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut
Approximation algorithms for constraint satisfaction problems (CSPs) are...
research
∙
05/01/2018
