dorsal/arxiv
View SchemaDiscrete Cosine Transforms on Quantum Computers
| Authors | Andreas Klappenecker, Martin Roetteler |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0111038 |
| URL | https://arxiv.org/abs/quant-ph/0111038 |
| Journal | IEEE R8-EURASIP Symposium on Image and Signal Processing and Analysis, pp. 464-468, Pula, Croatia, 2001 |
Abstract
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and interference principles. In fact, we show that it is possible to realize the discrete cosine transforms and the discrete sine transforms of size NxN and types I,II,III, and IV with as little as O(log^2 N) operations on a quantum computer, whereas the known fast algorithms on a classical computer need O(N log N) operations.
{
"annotation_id": "26316da8-242e-4d98-9a8d-c1c15a7432f2",
"date_created": "2026-03-02T18:01:45.858000Z",
"date_modified": "2026-03-02T18:01:45.858000Z",
"file_hash": "9e857426cf9a3dff22180a16a9b35a6d32993b3401e2991bef1e278a40dbe6d7",
"private": false,
"record": {
"abstract": "A classical computer does not allow to calculate a discrete cosine transform\non N points in less than linear time. This trivial lower bound is no longer\nvalid for a computer that takes advantage of quantum mechanical superposition,\nentanglement, and interference principles. In fact, we show that it is possible\nto realize the discrete cosine transforms and the discrete sine transforms of\nsize NxN and types I,II,III, and IV with as little as O(log^2 N) operations on\na quantum computer, whereas the known fast algorithms on a classical computer\nneed O(N log N) operations.",
"arxiv_id": "quant-ph/0111038",
"authors": [
"Andreas Klappenecker",
"Martin Roetteler"
],
"categories": [
"quant-ph",
"cs.ET"
],
"journal_ref": "IEEE R8-EURASIP Symposium on Image and Signal Processing and\n Analysis, pp. 464-468, Pula, Croatia, 2001",
"title": "Discrete Cosine Transforms on Quantum Computers",
"url": "https://arxiv.org/abs/quant-ph/0111038"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9378d0c6-9b43-41ed-8586-f0f1d93a4931",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}