Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability.

Laura Mancinska Thomas Vidick

Published in: ICALP (1) (2014)

Keyphrases

success probability
expected cost
dynamic programming
worst case
long run
decision trees
optimal solution
text mining
classification error