Improving (ε,δ)-PAC Monte Carlo tree search using spherical confidence regions

We consider a simplified version of the Monte Carlo tree search (MCTS) problem, a problem where, given a game tree with stochastic reward, one is tasked with finding the best move from the root. This problem is well studied, and recently impressive results have been obtained. For example, in 2016, when the AlphaGo program beat the professional...

Optimizing practical entanglement distillation

The goal of entanglement distillation is to turn a large number of weakly entangled states into a smaller number of highly entangled ones. Practical entanglement distillation schemes offer a trade-off between the fidelity to the target state and the probability of successful distillation. Exploiting such trade-offs is of interest in the...