Storing the quantum Fourier operator in the QuIDD data structure

Friedl Katalin and Kabódi László: Storing the quantum Fourier operator in the QuIDD data structure. In: Acta cybernetica, (23) 2. pp. 503-512. (2017)

[thumbnail of actacyb_23_2_2017_5.pdf]
Cikk, tanulmány, mű

Download (141kB) | Preview


Quantum algorithms can be simulated using classical computers, but the typical time complexity of the simulation is exponential. There are some data structures which can speed up this simulation to make it possible to test these algorithms on classical computers using more than a few qubits. One of them is QuIDD by Viamontes et al., which is an extension of the Algebraic Decision Diagram. In this paper, we examine the matrix of Fourier operator and its QuIDD representation. To utilize the structure of the operator we propose two orderings (reversed column variables and even-odd order), both resulting in smaller data structure than the standard one. After that, we propose a new method of storing the Fourier operator, using a weighted decision diagram that further reduces its size. It should be the topic of subsequent research whether the basic operations can be performed efficiently on this weighted structure.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2017
Volume: 23
Number: 2
ISSN: 0324-721X
Page Range: pp. 503-512
Language: English
Place of Publication: Szeged
Related URLs:
DOI: 10.14232/actacyb.23.2.2017.5
Uncontrolled Keywords: Algoritmus, QuiDD, Fourier-analízis
Additional Information: Bibliogr.: p. 511-512. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2018. Feb. 13. 08:45
Last Modified: 2022. Jun. 20. 14:26

Actions (login required)

View Item View Item