scientific article
From MaRDI portal
Publication:3549653
zbMath1232.68054arXivquant-ph/0612089MaRDI QIDQ3549653
Alexander Russell, Piotr Śniady, Moore, Cristopher
Publication date: 5 January 2009
Full work available at URL: https://arxiv.org/abs/quant-ph/0612089
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (7)
On the Complexity of the Hidden Subgroup Problem ⋮ Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula. ⋮ An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ Algebraic Methods in Quantum Informatics ⋮ Asymptotics of characters of symmetric groups related to Stanley character formula ⋮ Separation cutoffs for random walk on irreducible representations ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
This page was built for publication:
