scientific article; zbMATH DE number 5568412

MaRDI QIDQ3633739zbMATH OpenFDO

Authors Sebastian Dörn, Daniel Haase, Fabian Wagner, Jacobo Torán

Publication date 23 June 2009

zbMATH Keywords

graph isomorphisminteger factorizationhidden subgroup problemclassical and quantum computationring isomorphism problem

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Quantum computation (81P68) Factorization (11Y05)

Recommendations

• scientific article; zbMATH DE number 1302479
• An efficient quantum algorithm for some instances of the group isomorphism problem
• ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
• scientific article; zbMATH DE number 1464668
• Classical and Quantum Algorithms for Exponential Congruences
• Classical and quantum algorithms for testing equivalence of group extensions
• scientific article; zbMATH DE number 26476
• The computational complexity of equivalence and isomorphism problems
• scientific article

Cited in

(1)

• Complexity of ring morphism problems

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 Q3633739)