8 citations · 18 across the 6 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2024
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…
quant-ph2023
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…
quant-ph2021★ 7 cited
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…