{'fraction_non_alphanumeric': 0.011428571428571429, 'fraction_numerical': 0.004285714285714286, 'mean_word_length': 4.9914529914529915, '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}}
Calculating the Topological Resilience of Supply Chain Networks Using Quantum Hopfield Neural Networks

A quantum computing approach is presented for implementing a quantum version of a Hopfield Neural Network which is then used for solving the Minimum Vertex Cover (MVC) problem. A bijection maps the Minimum Vertex Cover of a graph to a stable pattern of the Quantum Hopfield Neural Network. The proposed algorithm reached a 100% accuracy in finding the minimum vertex cover for a testing dataset of graphs. The use of the Quantum HNN and quantum principles such as superposition enables the usage of potentially exponential power and speed up in solving NP-complete graph problems such as the MVC.