8 citations · 18 across the 6 of their papers we have counts for
6 papers
A unified approach to quantum de Finetti theorems and SoS rounding via geometric quantization
Sujit Rao
The sum-of-squares hierarchy of semidefinite programs has become a common tool for algorithm design in theoretical computer science, including problems in quantum information. In t…
Analysis of sum-of-squares relaxations for the quantum rotor model
Sujit Rao
The noncommutative sum-of-squares (ncSoS) hierarchy was introduced by Navascués-Pironio-Acín as a sequence of semidefinite programming relaxations for approximating values of nonco…
Quantum search-to-decision reductions and the state synthesis problem
Sandy Irani, Anand Natarajan, Chinmay Nirkhe +2
It is a useful fact in classical computer science that many search problems are reducible to decision problems; this has led to decision problems being regarded as the $\textit{de…
Macaulay bases of modules
Sujit Rao
We define Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay -bases to suitably graded modules over a commutative graded -al…
Chow Rings of Vector Space Matroids
Thomas Hameister, Sujit Rao, Connor Simpson
The Chow ring of a matroid (or more generally, atomic latice) is an invariant whose importance was demonstrated by Adiprasito, Huh and Katz, who used it to resolve the long-standin…
Dihedral Sieving Phenomena
Sujit Rao, Joe Suk
Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially -analogues, have useful interpretations related to actions and representations of the…