Efficient Quantum Transforms
| dc.creator | Hoyer, Peter | |
| dc.date | 1997-02-12 | |
| dc.date.accessioned | 2026-07-07T06:14:09Z | |
| dc.date.available | 2026-07-07T06:14:09Z | |
| dc.description | 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. | |
| dc.description | 30 pages, LaTeX2e, 7 figures included | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9702028 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9702028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93358 | |
| dc.subject | Quantum Physics | |
| dc.title | Efficient Quantum Transforms | |
| dc.type | text |