✦ LIBER ✦

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups

✍ Scribed by Gábor Ivanyos; Luc Sanselme; Miklos Santha

Book ID: 106149166
Publisher: Springer
Year: 2010
Tongue: English
Weight: 638 KB
Volume: 62
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-010-9467-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quantum Mechanical Algorithms for the No

Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem

✍ Michelangelo Grigni*; LeonardJ. Schulman†; Monica Vazirani‡; Umesh Vazirani§ 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 243 KB

A Subexponential-Time Quantum Algorithm

A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

✍ Kuperberg, Greg 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 228 KB

An efficient algorithm for constructing

An efficient algorithm for constructing the basis of a subgroup of a free group

✍ A. A. Letichevskii; A. B. Godlevskii; S. L. Krivoi 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 1022 KB

An Algorithm for Solving the Factorizati

An Algorithm for Solving the Factorization Problem in Permutation Groups

✍ T. Minkwitz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,

Efficient algorithms for two generalized

Efficient algorithms for two generalized 2-median problems and the group median problem on trees

✍ Chi-Yuan Chan; Shan-Chyun Ku; Chi-Jen Lu; Biing-Feng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 1004 KB

An efficient algorithm for solving the m

An efficient algorithm for solving the machine chaining problem in cellular manufacturing

✍ Wing S. Chow; Ostap Hawaleshka 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 327 KB