Storing the quantum Fourier operator in the QuIDD data structure
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...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2017
|
| Sorozat: | Acta cybernetica
23 No. 2 |
| Kulcsszavak: | Algoritmus, QuiDD, Fourier-analízis |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.2.2017.5 |
| Online Access: | http://acta.bibl.u-szeged.hu/50085 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 503-512 |
| ISSN: | 0324-721X |