It’s out!
Lots of nice-looking results.
By my count, about two thirds of the results are already on the arxiv. I hope the rest follows soon! (And yes, I’m a coauthor on a paper in the one third…)
O brave new quantum world!
O brave new quantum world!
It’s out!
Lots of nice-looking results.
By my count, about two thirds of the results are already on the arxiv. I hope the rest follows soon! (And yes, I’m a coauthor on a paper in the one third…)
Whew! I’m glad to see that I’m not the only element of the 1/3.
(Okay, I know that didn’t precisely make sense, but you know what I mean. Temporal juxtaposition weirds language. I guess the precise statement is “I’m glad to see that the set of which I already knew I was an element is actually rather large”…)
This is sort of like the 99% vs 1% issue, except that the memberships are (hopefully) less static.
“Hardness of approximation for quantum problems” looks interesting to me. http://arxiv.org/abs/1101.3884 Hey wait I was still a live pontiff when that came out. How come no one told me.
I don’t think that’s the same paper. It was a poster at last year’s QIP, and also it’s only algorithms; there are no hardness results in it. It is a really nice result, though, and I’m really looking forward to seeing the sequel!
Is it just me or are there more and more multi-author papers each year at QIP? Interestingly I’m always the most interested in the talks with one or maybe two authors 🙂