• Corpus ID: 118073555

Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups

@article{Cosme2007QuantumAF,
  title={Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups},
  author={Carlos Magno Martins Cosme and Renato Portugal},
  journal={arXiv: Quantum Physics},
  year={2007}
}
We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_{\phi}\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also address the HSP in the group $\Z_{N}\rtimes_{\phi}\Z_{p^2}$, where $N$ is an integer with a special prime factorization. These quantum algorithms are exponentially faster than any classical algorithm for the same purpose. 
The computational power of normalizer circuits over black-box groups
TLDR
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems, and finds that normalizer circuits are powerful enough to factorize and solve classically-hard problems in the black-box setting.
Abelian Hypergroups and Quantum Computation
TLDR
A stabilizer formalism using abelian hypergroups and an associated classical simulation theorem is developed and a new, hypergroup-based algorithm for the HNSP on nilpotent groups is developed.
Normalizer Circuits and Quantum Computation
TLDR
An efficient formalism for simulating families of quantum circuits, that are non-universal but comprise important quantum gates such as QFT or CNOT, is developed and used to design new algorithms that provide quantum speedups.
Quantum Computation Beyond the
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of
Quantum computation beyond the circuit model
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of
Problema do Subgrupo Oculto em uma Classe de Produto Semidireto de Grupos
We present an efficient quantum algorithm for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups Zpr oφ Zps , wherep is any odd prime number and r ands are any positives
Algoritmos Quânticos para uma Classe de Produtos Semi-diretos de Grupos
Nós apresentamos um algoritmo quântico eficiente para o problema do subgrupo oculto (PSO) sobre produto semi-direto de grupos ZN oφ Zp, onde p é um número primo ı́mpar, m,N inteiros positivos. Nós