1-dan master of the unyielding fist of Bayesian inference
3559 stories
·
0 followers

Stockfish 11 has been released

1 Share
submitted by /u/DynMaxBlaze to r/ComputerChess
[link] [comments]
Read the whole story
clumma
23 hours ago
reply
Berkeley, CA
Share this story
Delete

Benton Roark performs 'Sundog' on the Lumatone microtonal keyboard

1 Share
submitted by /u/clumma to r/microtonal
[link] [comments]
Read the whole story
clumma
3 days ago
reply
Berkeley, CA
Share this story
Delete

MIP*=RE

1 Share

Here’s the paper, which weighs in at 165 pages. The authors are Zhengfeng Ji, Anand Natarajan, my former postdoc Thomas Vidick, John Wright (who will be joining the CS faculty at UT Austin this fall), and my wife’s former student Henry Yuen. Rather than pretending that I can provide intelligent commentary on this opus in the space of a day, I’ll basically just open my comment section to discussion and quote the abstract:

We show that the class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. Our proof builds upon the quantum low-degree test of (Natarajan and Vidick, FOCS 2018) by integrating recent developments from (Natarajan and Wright, FOCS 2019) and combining them with the recursive compression framework of (Fitzsimons et al., STOC 2019).
An immediate byproduct of our result is that there is an efficient reduction from the Halting Problem to the problem of deciding whether a two-player nonlocal game has entangled value 1 or at most 1/2. Using a known connection, undecidability of the entangled value implies a negative answer to Tsirelson’s problem: we show, by providing an explicit example, that the closure Cqa of the set of quantum tensor product correlations is strictly included in the set Cqc of quantum commuting correlations. Following work of (Fritz, Rev. Math. Phys. 2012) and (Junge et al., J. Math. Phys. 2011) our results provide a refutation of Connes’ embedding conjecture from the theory of von Neumann algebras.

I can remember when the class MIP* was first defined and studied, back around 2003, and people made the point that we didn’t know any reasonable upper bound on the class’s power—not NEXP, not NEEEEXP, not even the set of all computable languages. Back then, the joke was how far our proof techniques were from what was self-evidently the truth. I don’t remember a single person who seriously contemplated that two entangled provers could convince a polynomial-time verifier than an arbitrary Turing machine halts.

Still, ever since Natarajan and Wright’s NEEXP in MIP* breakthrough last year, all of us in quantum computing theory knew that MIP*=RE was a live possibility—and all through the summer and fall, I heard many hints that such a breakthrough was imminent.

The usual proviso applies: when I’ve blogged about preprints with amazing new results, most have stood, but at least two ended up being retracted. Still, assuming this one stands (as I’m guessing it will), I regard it as easily one of the biggest complexity-theoretic (and indeed computability-theoretic!) surprises so far in this century. Huge congratulations to the authors on what looks to be a historic achievement.

In unrelated news, for anyone for whom the 165-page MIP* paper is too heavy going (really??), please enjoy this CNBC video on quantum computing, which features several clips of yours truly speaking in front of a fake UT tower.

Read the whole story
clumma
4 days ago
reply
Berkeley, CA
Share this story
Delete

The JavaScript framework for visual programming

1 Share
submitted by /u/krasimirtsonev to r/javascript
[link] [comments]
Read the whole story
clumma
5 days ago
reply
Berkeley, CA
Share this story
Delete

Three-Dimensional Multi-State Cellular Automata: 445

1 Share
Three-Dimensional Multi-State Cellular Automata: 445 submitted by /u/cellularautomataalt to r/cellular_automata
[link] [comments]
Read the whole story
clumma
8 days ago
reply
Berkeley, CA
Share this story
Delete

Two-Dimensional Hexagonal Multi-State Cellular Automata: Bombermen

1 Share
Two-Dimensional Hexagonal Multi-State Cellular Automata: Bombermen submitted by /u/cellularautomataalt to r/cellular_automata
[link] [comments]
Read the whole story
clumma
8 days ago
reply
Berkeley, CA
Share this story
Delete
Next Page of Stories