Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

etailed Account of Complexity for Implementation of Circuit-Based Quantum Algorithm

Full text
Author(s):
Cardoso, Fernando R. [1] ; Akamatsu, Daniel Yoshio [1] ; Campo Junior, Vivaldo Leiria [1] ; Duzzioni, Eduardo I. [2] ; Jaramillo, Alfredo [3] ; Villas-Boas, Celso J. [1]
Total Authors: 6
Affiliation:
[1] Univ Fed Sao Carlos, Dept Fis, Sao Carlos - Brazil
[2] Univ Fed Santa Catarina, Dept Fis, Florianopolis, SC - Brazil
[3] Univ Sao Paulo, Escola Engn Sao Carlos, Sao Carlos - Brazil
Total Affiliations: 3
Document type: Review article
Source: FRONTIERS IN PHYSICS; v. 9, NOV 1 2021.
Web of Science Citations: 0
Abstract

In this review article, 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 the preparation of an arbitrary superposition state and readout of the final state, in most of the cases can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of circuit-based quantum algorithms, 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 space and time costs of the processes. (AU)

FAPESP's process: 19/11999-5 - Collective effects on atomic systems, nuclear spins and cavity quantum electrodynamics
Grantee:Celso Jorge Villas-Bôas
Support Opportunities: Regular Research Grants