78 citations · 335 across the 44 of their papers we have counts for
4 papers · 1 filter
Explicit near-Ramanujan graphs of every degree
Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes
For every constant and , we give a deterministic -time algorithm that outputs a -regular graph on vertices that is -near-Ramanujan;…
The SDP value for random two-eigenvalue CSPs
Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes
We precisely determine the SDP value (equivalently, quantum value) of large random instances of certain kinds of constraint satisfaction problems, ``two-eigenvalue 2CSPs''. We show…
Lower bounds for testing complete positivity and quantum separability
Costin Bădescu, Ryan O'Donnell
In this work we are interested the problem of testing quantum entanglement. More specifically, we study the separability problem in quantum property testing, where one is given …
-Ramanujan Graphs
Sidhanth Mohanty, Ryan O'Donnell
Let be an infinite graph of bounded degree; e.g., the Cayley graph of a free product of finite groups. If is a finite graph covered by , it is said to be -Ramanujan i…