13 papers
On the Approximability of Boolean Max--CSP
Ainesh Bakshi
Consider the problem of maximizing the number of satisfied constraints of an arbitrary boolean constraint satisfaction problem with arity . We obtain a polynomial time algorithm…
Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
Ainesh Bakshi, Arpon Basu, Pravesh Kothari +1
We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level Kikuchi graph of any graph with edges is at most . This confirms four rec…
Learning quantum Hamiltonians at any temperature in polynomial time
Ainesh Bakshi, Allen Liu, Ankur Moitra +1
We study the problem of learning a local quantum Hamiltonian given copies of its Gibbs state at a known inverse temperature . Anshu,…
Structure learning of Hamiltonians from real-time evolution
Ainesh Bakshi, Allen Liu, Ankur Moitra +1
We study the problem of Hamiltonian structure learning from real-time evolution: given the ability to apply for an unknown local Hamiltonian $H = \sum_{a = 1}^…
Entrywise Low-Rank Approximation and Matrix Norms via Global Correlation Rounding
Prashanti Anderson, Ainesh Bakshi, Samuel B. Hopkins
Given a matrix , the goal of the entrywise low-rank approximation problem is to find over all rank- matrices , where is t…
Rapid mixing for high-temperature Gibbs states with arbitrary external fields
Ainesh Bakshi, Xinyu Tan
Gibbs states are a natural model of quantum matter at thermal equilibrium. We investigate the role of external fields in shaping the entanglement structure and computational comple…