46 search results - page 3 / 10 » Quantum algorithms for solvable groups |
ICMS
2010
14 years 7 months ago
2010
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
CISS
2007
IEEE
14 years 11 months ago
2007
IEEE
— Flexible distribution of data in the form of quantum bits (qubits) amongst spatially separated entities is an essential component of envisioned scalable quantum computing archi...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
STACS
1999
Springer
15 years 1 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...