Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms
Abstract
In this work, we are interested in the detailed analysis of complexity aspects of both time and space that arises from the implementation of a quantum algorithm on a quantum based hardware. In particular, some steps of the implementation, as state preparation and readout processes, in most of the cases can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations, from state preparation to the number of measurements needed to obtain good statistics from the final states of the quantum system, in order to assess the overall complexity of the processes.
Cite
@article{arxiv.2106.12517,
title = {Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms},
author = {Fernando R. Cardoso and Daniel Yoshio Akamatsu and Vivaldo Leiria Campo Junior and Eduardo I. Duzzioni and Alfredo Jaramillo Palma and Celso J. Villas-Boas},
journal= {arXiv preprint arXiv:2106.12517},
year = {2021}
}
Comments
Some reviews in the main text have been made since the first version. 11 pages, 2 figures, 1 table. Comments are welcome