The role of super-fast transforms in speeding up quantum computations

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2002, Pages 129-135

  Zilic, Zeljko ^a   Radecka, Katarzyna ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FAST FOURIER TRANSFORMS; MANY VALUED LOGICS; POLYNOMIALS;

QUANTUM ALGORITHMS; QUANTUM COMPUTATION; SUPER FAST TRANSFORMS;

QUANTUM THEORY;

EID: 0036086131     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Synthesis and canonical representations of equally input-output binary and multiple-valued Galois quantum logic
2. Development of quantum functional devices for multiple-valued logic circuits
3. Experimental implementation of fast quantum searching
4. Fast parallel circuits for the quantum Fourier transform
5. An algorithm for the machine calculation of complex Fourier series
6. An approximate Fourier transform useful in quantum factoring
7. Quantum device model based super pass gate for multiple-valued digital systems
8. Quantum theory, the church-Turing principle and the universal quantum computer
9. Bulk spin-resonance quantum computing
10. A fast quantum-mechanical algorithm for database search
11. Quantum algorithms and the Fourier transform
12. Polynomial time algorithms for prime factorization and discrete logarithm
13. Toward quantum computation: A five-qubit quantum processor