Year: 2022
Type: article
Abstract: Many quantum algorithms have been proposed which are drastically more efficient that the best of the non-quantum algorithms for solving the same problems. A natural question is: are these quantum algorithms already optimal – in some reasonable sense – or they can be further improved? In this paper, we review recent results showing that many known quantum algorithms are actually optimal. Several of these results are based on appropriate invariances (symmetries). Specifically, we show that the following algorithms are optimal: Grover’s algorithm for fast search in an unsorted array, teleportation algorithm – which is important for parallel quantum computations, and quantum annealing optimization algorithm. This covers many algorithms related to quantum computing. We also mention that algorithms for quantum communication and Deutsch-Josza algorithm – for fast checking whether a bit affect computation results – are optimal. In all these cases, optimality is shown not just for one specific optimality criterion, but for all possible optimality criteria that satisfy the natural invariance requirement.
Authors: Vladik Kreinovich, Oscar Galindo, Olga Kosheleva
Institution: The University of Texas at El Paso
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Funder: National Science Foundation
Awards: RAPID: Building Research Capabilities of Academically Talented Undergraduate Students from Hispanic-Serving Institutions through Virtual Research Experiences, IUSE/PFE:RED: A Model of Change for Preparing a New Generation for Professional Practice in Computer Science, NSF INCLUDES Alliance: Computing Alliance of Hispanic-Serving Institutions
OpenAlex ID: W4313390612