Efficient Quantum Transforms
Author:
Preprint
Abstract
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a generalized Kronecker product is given. Applications include re-development of the networks for computing the Walsh-Hadamard and the quantum Fourier transform. New networks for two wavelet transforms are given. Quantum computation of Fourier transforms for non-Abelian groups is defined. A slightly relaxed definition is shown to simplify the analysis and the networks that computes the transforms. Efficient networks for computing such transforms for a class of metacyclic groups are introduced. A novel network for computing a Fourier transform for a group used in quantum error-correction is also given.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Quantum Error Correction and Orthogonal GeometryPhysical Review Letters, 1997
- Simple quantum error-correcting codesPhysical Review A, 1996
- Multiple-particle interference and quantum error correctionProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1996
- Class of quantum error-correcting codes saturating the quantum Hamming boundPhysical Review A, 1996
- Quantum networks for elementary arithmetic operationsPhysical Review A, 1996
- Semiclassical Fourier Transform for Quantum ComputationPhysical Review Letters, 1996
- Elementary gates for quantum computationPhysical Review A, 1995
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum computational networksProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1989