QUANTUM ALGORITHMS FOR OPTIMIZATION USING ASYMPTOTIC QUANTUM SEARCH

Autor:	Paulo Benicio Melo de Sousa, Rubens Viana Ramos
Rok vydání:	2008
Předmět:	Quantum network Physics and Astronomy (miscellaneous) Quantum error correction Quantum process Quantum phase estimation algorithm Quantum operation Quantum algorithm Quantum information Algorithm Quantum computer
Zdroj:	International Journal of Quantum Information. :935-944
ISSN:	1793-6918 0219-7499
DOI:	10.1142/s021974990800416x
Popis:	Problems of optimization are very common in several areas like engineering, physics, economics and mathematics and usually, they are very difficult to solve. Basically, one has to find the minimum or maximum of an objective function. In this work, we chose two optimization problems and we present quantum algorithms to solve them. The problems are: (1) to find the best decomposition of a unitary operation achievable by a programmable quantum circuit; (2) to find the minimal distance of a linear code. The quantum algorithms used are asymptotic quantum search and their main property is the fact that only one measurement is required.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::fc47f85d7b845dc2473c2580c988e393 https://doi.org/10.1142/s021974990800416x Zobrazit plný text záznamu