{'fraction_non_alphanumeric': 0.019801980198019802, 'fraction_numerical': 0.0, 'mean_word_length': 5.679245283018868, '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}}
Exactly solvable Hamiltonians in quantum computing

In this paper, we investigate the problem of simulation of quantum-mechanical dynamical system with prescribed properties using of exactly solvable Hamiltonians. A method for solving time-dependent matrix Schrodinger equations in an explicit analytical form will be developed. It is based on exactly solvable time-independent problems, a certain choice of the initial conditions, and special time-dependent gauge transformations converting time-independent problems to time-dependent ones. An application of the exactly solvable time-dependent problems thus obtained to the construction of a universal set of gates for quantum computers is also presented.