{'fraction_non_alphanumeric': 0.023809523809523808, 'fraction_numerical': 0.002380952380952381, 'mean_word_length': 5.5703125, '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}}
Test of Bell’s and Mermin’s inequalities on Quantum Computer

Quantum computers have tremendous potential of simulating large quantum systems that classical computers can’t. In the theoretical verification of quantum non-locality principle, Bell’s and Mermin’s inequalities stood out, which proved to be valid in multiple empirical experiments. In this paper we report the tests of Bell and Mermin’s inequalities carried out on the 2- qubit and 3-qubit IBM quantum computer respectively. By comparing the result we obtained and the pattern predicted by the inequalities, our experimental results indicate clear violations of the two inequalities; thereby, we validate postulates in quantum mechanics and disprove the local realism argument in classical hidden variable theories proposed by Einstein, Podolsky, and Rosen on quantum circuits.