Graduate student in physics at UIUC.

Since summer 2014, I started pursuing complexity theory.

Now looking for a PhD. position in theoretical-CS (preferably in quantum computing/information/complexity or in optimization theory/statistical learning theory)

Please contact me if you have open positions!

Aug
27
comment What has "$\delta$ Gromov hyperbolic space" got to do with $\mathbb{H}_n$?
Thanks for the reply! I am thinking of stuff like what is the analogue of Bourgain's theorem here.
Aug
27
comment What has "$\delta$ Gromov hyperbolic space" got to do with $\mathbb{H}_n$?
(1) Could you kindly elaborate on the proof that $\mathbb{H}_n$ is a $\delta$-Gromov hyperbolic? (2) Is there some known embedding of a $\delta$-Gromov hyperbolic metric space into some $\mathbb{H}_n$?
Aug
26
comment Embedding graphs into hyperbolic spaces
Many of these references talk of the ``$\delta$-Gromov hyperbolic" space. Can you explain why is that related to the usual $\mathbb{H}_n$?
Aug
26
asked What has "$\delta$ Gromov hyperbolic space" got to do with $\mathbb{H}_n$?
Aug
26
comment Embedding graphs into hyperbolic spaces
Thanks! Let me see them. What would be a good reason for say complexity theorists to try embedding a graph into a hyperbolic space?
Aug
26
comment Algorithm for embedding a graph with metric constraints
Correct me if I am wrong : Doesn't section 2.6 of the paper "Local-Global Tradeoffs in Metric Embedding" by Moses-Yury-Konstantin supersede Linial-London-Rabinovich? (It would be great if you could compare the two papers and what is the most recent thing known in this direction!)
Aug
26
revised Embedding graphs into hyperbolic spaces
added 276 characters in body
Aug
25
revised Embedding graphs into hyperbolic spaces
added 20 characters in body
Aug
24
revised Embedding graphs into hyperbolic spaces
added 4 characters in body
Aug
24
asked Embedding graphs into hyperbolic spaces
Aug
24
asked CFTs and hyperbolic spaces
Aug
8
comment As a grad student how to approach a possible breakthrough research?
^I think you are reading the question unfairly. I think the author clearly means that the heuristic is seen to be working in as many cases as they have tested and that they have tested extensively. I feel that its obvious that all this basic diligence has been done.
Aug
6
revised What are the recent TCS books whose drafts are available online?
added 264 characters in body
Aug
6
answered What are the recent TCS books whose drafts are available online?
Aug
4
revised How does one determine if a mixed bipartite quantum state is entangled or not?
added 6 characters in body
Aug
4
revised How does one determine if a mixed bipartite quantum state is entangled or not?
added 248 characters in body
Aug
3
awarded Scholar
Aug
3
accepted How does one determine if a mixed bipartite quantum state is entangled or not?
Aug
3
comment How does one determine if a mixed bipartite quantum state is entangled or not?
Yeah! Sorry. I swapped the words! If $\rho$ is non-entangled then one can hope to give as cetificate the decomposition $\rho = \sum xx^T \otimes yy^T$ and that puts non-entanglement in NP (modulo issues of representing real numbers) But entanglement seems to be in co-NP.
Aug
3
comment How does one determine if a mixed bipartite quantum state is entangled or not?
^(1) So there is no polynomial certificate for non-entanglement and hence non-entanglement yes/no question is in co-NP, right? (2) Well even if some question is NP-hard a "better" way to test is still possible in terms of various other kinds of improvements like reducing the exponent of the checking time or a simpler method though still exponential or even someone showing a NP-certificate for entanglement. I was wondering along these lines...
1 2 3 4 5