Quantum computation of Fourier transforms over symmetric groups

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 48-53

  Beals, Robert ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; POLYNOMIALS;

FINITE ABELIAN GROUPS; QUANTUM COMPLEXITY THEORY; QUANTUM POLYNOMIAL TIME ALGORITHM;

FOURIER TRANSFORMS;

EID: 0030642909     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258548     Document Type: Conference Paper

References (12)