Documents
Presentation Slides
Compressed Input Data Format of Quantum Annealing Emulator
![](https://sigport.org/sites/default/files/styles/home/public/DCC_2023_3_0.jpg?itok=Df5ZzK3h)
- Citation Author(s):
- Submitted by:
- Sohei Shimomai
- Last updated:
- 26 February 2023 - 3:44pm
- Document Type:
- Presentation Slides
- Document Year:
- 2023
- Event:
- Presenters:
- Sohei Shimomai
- Categories:
- Log in to post comments
Recently, Quantum Annealing (QA) has attracted attention as an efficient algorithm for combinatorial optimization problems. In QA, the input data size becomes large and its reduction is important for accelerating by the hardware emulation since the usable memory size and its bandwidth are limited. The paper proposes the compression method of input sparse matrices for QA emulator. The proposed method uses the sparseness of the coefficient matrix and the reappearance of the same values. An independent table is introduced and data are compressed by the search and registration method of two consecutive data in the value table.The proposed method is applied to Traveling Salesman Problems (TSP) with 32, 64 and 96 cities. The proposed method could reduce the amount of data 1/40 for 96 city TSP and could manage 96 city TSP on the hardware emulator. The data reduction is also useful for the simulation/emulation performance when using the compressed data directly and 1.9 times faster speed can be found on 96 city TSP than the CSR-based method.