ACM/IEEE Design Automation Conference (DAC)
SiTA: Exploiting Sparsity in Tensor-Product for Accelerating Quantum Readout Error Mitigation
Hanyu Zhang, Zhiwei Ye, Liqiang Lu, Kai Zhou, Fangxu Guo, Siwei Tan, Fangxin Liu, Size Zheng, Jianwei Yin
Abstract
Though quantum computing theoretically provides exponential computational advantage, an end-to-end quantum speedup should consider the encoding, compilation, and many other peripheral process that rely on classical computer. Among them, the readout error mitigation turns out to be the bottleneck, requiring mitigation of noise errors to achieve high fidelity. To this end, leveraging the sparsity in the tensor-product has emerged as an appealing approach to improve computational efficiency. However, existing approaches, based on intermediate data pruning or threshold pruning, suffer from the limited accelerator and fidelity loss. In this paper, we propose SiTA, a quantum error mitigation accelerator that exploits the inherent sparsity of Hilbert space. The key insight is that the superposition states generated by quantum algorithms cover only a subset of the Hilbert space (output sparsity), and the basis state naturally exhibits bit-level sparsity (input sparsity). Therefore, we introduce a sparse dataflow that features probability-level and state-level parallelism, which effectively skips calculations related to zero values. Finally, we design its hardware architecture that supports various computational paradigms of tensor-product, enabling acceleration for readout error mitigation. Experiments show that SiTA achieves an end-to-end speedup of 4.9× to 1604× over prior mitigation methods, without sacrificing fidelity.