scientific article; zbMATH DE number 5485489

MaRDI QIDQ3549653zbMATH OpenFDO

Authors Cristopher Moore, Alexander Russell, Piotr Śniady

Publication date 5 January 2009

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

zbMATH Keywords

quantum algorithmhidden subgroup problemgraph isomorphism problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Quantum algorithms and complexity in the theory of computing (68Q12)

Cited in

(8)

• Algebraic Methods in Quantum Informatics
• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• Separation cutoffs for random walk on irreducible representations
• Asymptotics of characters of symmetric groups related to Stanley character formula
• Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula.
• Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
• Applications of finite non-abelian simple groups to cryptography in the quantum era
• On the Complexity of the Hidden Subgroup Problem

This page was built for publication:

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