scientific article

zbMATH Open1232.68054arXivquant-ph/0612089MaRDI QIDQ3549653FDOQ3549653

Authors: Cristopher Moore, Alexander Russell, Piotr Śniady 

Publication date: 5 January 2009

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

Title of this publication is not available (Why is that?)

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)

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

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)