{'fraction_non_alphanumeric': 0.016913319238900635, 'fraction_numerical': 0.0021141649048625794, 'mean_word_length': 4.955974842767295, '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}}
Quantum Algorithmic Complexity of Three-Qubit Pure States

For pure three-qubit states the classification of entanglement is both non-trivial and well understood. In this work, we study the quantum algorithmic complexity introduced in [1] of three-qubit pure states belonging to the most general class of entanglement. Contrary to expectations we find out that the degree of entanglement of states in this class quantified by the measure of 3-tangle, does not correlate with the quantum algorithmic complexity, defined as the length of the shortest circuit needed to prepare the state. For a given entangled state the evaluation of its quantum complexity is done via a pseudo random evolutionary algorithm. This algorithm allows us not only to determine the complexity of a quantum circuit in terms of the number of required quantum gates, but also to estimate another type of complexity related to the time required to obtain the correct answer.