skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Application of quantum algorithms to the study of permutations and group automorphisms

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{sub p-1}{sup m} to Aut(Z{sub 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 when 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.

Authors:
 [1];  [1];  [2]
  1. Department of Mathematics, Graduate Center of the City University of New York, 365 Fifth Avenue, New York, New York 10016 (United States)
  2. Research Center for Quantum Information, Slovak Academy of Sciences, Dubravska cesta 9, 845 11 Bratislava (Slovakia)
Publication Date:
OSTI Identifier:
21011191
Resource Type:
Journal Article
Journal Name:
Physical Review. A
Additional Journal Information:
Journal Volume: 76; Journal Issue: 1; Other Information: DOI: 10.1103/PhysRevA.76.012324; (c) 2007 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 1050-2947
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ALGORITHMS; CONTROL THEORY; DATA PROCESSING; INFORMATION THEORY; QUANTUM COMPUTERS; QUANTUM INFORMATION; QUANTUM MECHANICS

Citation Formats

Bonanome, Marianna, Hillery, Mark, Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021, and Buzek, Vladimir. Application of quantum algorithms to the study of permutations and group automorphisms. United States: N. p., 2007. Web. doi:10.1103/PHYSREVA.76.012324.
Bonanome, Marianna, Hillery, Mark, Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021, & Buzek, Vladimir. Application of quantum algorithms to the study of permutations and group automorphisms. United States. https://doi.org/10.1103/PHYSREVA.76.012324
Bonanome, Marianna, Hillery, Mark, Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021, and Buzek, Vladimir. 2007. "Application of quantum algorithms to the study of permutations and group automorphisms". United States. https://doi.org/10.1103/PHYSREVA.76.012324.
@article{osti_21011191,
title = {Application of quantum algorithms to the study of permutations and group automorphisms},
author = {Bonanome, Marianna and Hillery, Mark and Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 and Buzek, Vladimir},
abstractNote = {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{sub p-1}{sup m} to Aut(Z{sub 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 when 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.},
doi = {10.1103/PHYSREVA.76.012324},
url = {https://www.osti.gov/biblio/21011191}, journal = {Physical Review. A},
issn = {1050-2947},
number = 1,
volume = 76,
place = {United States},
year = {Sun Jul 15 00:00:00 EDT 2007},
month = {Sun Jul 15 00:00:00 EDT 2007}
}