{'fraction_non_alphanumeric': 0.01968503937007874, 'fraction_numerical': 0.000984251968503937, 'mean_word_length': 5.436708860759493, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
How to Teach AI to Play Bell Non-Local Games: Reinforcement Learning

Motivated by the recent success of reinforcement learning in games such as Go and Dota2, we formulate Bell non-local games as a reinforcement learning problem. Such a formulation helps us to explore Bell non-locality in a range of scenarios. The measurement settings and the quantum states are selected by the learner randomly in the beginning. Still, eventually, it starts understanding the underlying patterns and discovers an optimal (or near-optimal) quantum configuration corresponding to the task at hand. We provide a proof of principle approach to learning quantum configurations for violating various Bell inequalities. The algorithm also works for non-convex optimization problems where convex methods fail, thus offering a possibility to explore optimal quantum configurations for Bell inequalities corresponding to large quantum networks. We also implement a hybrid quantum-classical variational algorithm with reinforcement learning.