Work

Fundamentos de algoritmos quânticos e complexidade

Year: 2021
Type: dissertation
Abstract: Recently, quantum computation has been generating a lot of interesting from both industry and academia, due to the first results on quantum supremacy, i.e. the first time quantum computers were able to perform efficiently tasks deemed unfeasible to classical computers, made possible by the state-of-art qubit technology. These achievements, despite the unusefulness of the tasks performed (quantum circuit sampling), provide evidence that real world quantum computation is not only evolving, but also, that full-scale quantum computers may be a reality in the mid-term future. The benefits of quantum computation are well-known to be potentially ground-breaking, from making of RSA cryptography unsecure, to the efficient simulation of quantum systems. On theoretical side, the algorithm body of knowledge has evolved, and nowadays, there is already a huge number of algorithms and techniques, scattered across a vast realm of applications, from solving certain linear equations to optimization. Nonetheless, the progress in the development of new algorithms with an exponential advantage, rather than polynomial, has been quite slow and even the application of the most general quantum computational techniques to new problems is far from a trivial task. The main motivation for this work was to contribute to this problem, and doing so by following a foundational approach, i.e. by the understanding of the structures behind quantum algorithms and the conception of formal methods to aid in their construction. Such an approach has to deal with two somewhat orthogonal dimensions, which correspond to traditionally mutual exclusive fields of study, complexity and semantics, and hence, the contribution of this work is also two-fold: in one hand we try to identify and characterize the structures that carry the so-called quantum advantage, and in the other hand by dealing with the correction of quantum algorithms, in this case a dynamic logic for a particular class of quantum programs: the ones expressible on a fragment of the quantum assembly programming language (QASM). Furthermore, a relevant part of the contribution of this work is the use of the theoretical findings over new fields of application of quantum algorithms. The first one is in the field of quantum biology, including the simulation of the non-radiative effects of electronic transport through a molecular chain in a photosyn thesis system. The other one belongs to the field of quantum chemistry, namely, the calculation of the ground state of the Hydrogen and Lithium-Hydride molecules, under the action of a strong electrical field (the stationary Stark effect). Both applications were carried out in a real world quantum computer, the IBM Q
Author: Tavares, Carlos Eduardo Teixeira
Institution: University of Minho
Language: English
Open Access status: green
OpenAlex ID: W7084188531
Cites: 347
Cited by:
Related to: 10