Quantum algorithms for Simon's problem over general groups

MaRDI QIDQ2934717zbMATH OpenFDO

Authors Gorjan Alagic, Cristopher Moore, Alexander Russell

Publication date 18 December 2014

Mathematics Subject Classification ID

Abstract finite groups (20D99) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Quantum algorithms for Simon's problem over nonabelian groups
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• The Symmetric Group Defies Strong Fourier Sampling
• Normal subgroup reconstruction and quantum computation using group representations
• Hidden symmetry subgroup problems

Cited in

(15)

• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• Deterministic polynomial-time quantum algorithms for Simon's problem
• Query complexity of generalized Simon's problem
• Quantum algorithms for Simon's problem over nonabelian groups
• Normal subgroup reconstruction and quantum computation using group representations
• Multi-query quantum sums
• Hidden symmetry detection on a quantum computer
• The Symmetric Group Defies Strong Fourier Sampling
• scientific article; zbMATH DE number 1303028 (Why is no real title available?)
• Quantum algorithms for a set of group theoretic problems
• Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
• Theoretical Computer Science
• Hidden symmetry subgroup problems
• Automata, Languages and Programming
• Zero sum subsequences and hidden subgroups

This page was built for publication: Quantum algorithms for Simon's problem over general groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934717)