46 search results - page 1 / 10 » Quantum algorithms for solvable groups |
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
ECCC
2010
13 years 5 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
COCO
2004
Springer
13 years 8 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...