The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms (Q1856841): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/0007122 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantum algorithms revisited / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3090378 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5719437 / rank | |||
Normal rank | |||
Latest revision as of 11:26, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms |
scientific article |
Statements
The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms (English)
0 references
11 February 2003
0 references
quantum Fourier transform
0 references
quantum computing
0 references
Walsh-Hadamard transform
0 references
unitary group
0 references
algorithm
0 references
