BONANOME, Marianna, Mark HILLERY and Vladimír BUŽEK. Applications of quantum algorithms to the study of group automorphisms. Physical Review A. New York: American Physical Society, 2007, Vol. 76, No. 1, p. A012324, 6 pp. ISSN 1050-2947.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Applications of quantum algorithms to the study of group automorphisms
Name in Czech Aplikace kvantových algoritmů při studiu automorfismů grup
Authors BONANOME, Marianna (840 United States of America), Mark HILLERY (840 United States of America) and Vladimír BUŽEK (203 Czech Republic, guarantor).
Edition Physical Review A, New York, American Physical Society, 2007, 1050-2947.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Impact factor Impact factor: 2.893
RIV identification code RIV/00216224:14330/07:00020702
Organization unit Faculty of Informatics
UT WoS 000248486600062
Keywords in English quantum information processing; group automorphism; quantum algorithms
Tags group automorphism, quantum algorithms, quantum information processing
Tags International impact, Reviewed
Changed by Changed by: RNDr. Lukáš Boháč, učo 4111. Changed: 29/6/2009 22:11.
Abstract
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to $Aut(Z_{p})$ where $p$ is prime. The remaining two make use of modifications of the Grover search algorithm. The first finds the fixed point of a permutation or an automorphism (assuming it has only one besides the identity). It can be generalized to find cycles of a specified size for permutations or orbits of a specified size for automorphisms. The second finds which of a set of permutations or automorphisms maps one particular element of a set or group onto another. This has relevance to the conjugacy problem for groups. We show how two of these algorithms can be implemented via programmable quantum processors. This approach opens new perspectives in quantum information processing, wherein both the data and the programs are represented by states of quantum registers. In particular, quantum programs that specify control over data can be treated using methods of quantum information theory.
Abstract (in Czech)
Analýza tří aplikací efektivních kvantových algoritmů pro určení vlastností permutací a automorfismů grup.
Links
GA201/07/0603, research and development projectName: Výpočty, komunikace a bezpečnost kvantových distribuovaných systémů
Investor: Czech Science Foundation, Quantum multipartite computation, communication and security
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 2/10/2024 05:07