Permutation groups, minimal degrees and quantum computing.

DOI10.4171/GGD/24zbMath1143.20002arXivquant-ph/0607204WikidataQ102355666 ScholiaQ102355666MaRDI QIDQ2469771

Julia Kempe, Aner Shalev, László Pyber

Publication date: 7 February 2008

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0607204

zbMATH Keywords

characterspermutation groupsquantum computingminimal degreeorder boundshidden subgroup problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Ordinary representations and characters (20C15) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Quantum computation (81P68) Subgroups of symmetric groups (20B35)

Related Items

On the minimal degree of a transitive permutation group with stabilizer a 2-group ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree ⋮ Asymptotically optimal induced universal graphs ⋮ Improved constructions of mixed state quantum automata

Cites Work

• On the order of doubly transitive permutation groups
• On the order of uniprimitive permutation groups
• On the minimal degree of a primitive permutation group
• On the number of conjugacy classes of a finite group
• Classifying the finite simple groups
• Finite Permutation Groups and Finite Simple Groups
• Parameters of Goppa codes revisited
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Limitations of quantum coset states for graph isomorphism
• On quantum algorithms for noncommutative hidden subgroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item