The quest to demonstrate quantum advantage in solving useful computational problems is a driving force motivating researchers to engineer better hardware providing more reliable gate operations, efficient algorithms to exploit the accessible hardware resources, and approaches to compile quantumprograms utilizing the fewest logical operations. All of these efforts are spent for the sake of scaling up quantum computation to exhibit quantum advantage in solving computational problems.From the viewpoint of developing quantum algorithms we need to mention a class of algorithms tailored by the combination of quantum and classical resources that are believed to show practical advantage over classical computing. The potential applications of variational quantum algorithms are therefore extensive, encompassing areas such as drug discovery, material science, chemical engineering, quantum optimization, and QML. The compilation of quantum programs for real quantum hardware is another key ingredient to scale up quantum computing. Naturally, in calculations carried out on quantum devices, the error of the circuits is growing with the number of gates. This pinpoints the crucial role of quantum circuit optimizations. In our research group we address these research topics by developing high performance algorithms and implementations.