Fast reconstruction algorithm based on HMC sampling

• Published in: Scientific reports Vol. 13; no. 1; p. 17773
• Main Authors: Lian, Hang, Xu, Jinchen, Zhu, Yu, Fan, Zhiqiang, Liu, Yi, Shan, Zheng
• Format: Journal Article
• Language: English
• Published: London Nature Publishing Group 18.10.2023; Nature Publishing Group UK; Nature Portfolio
• Subjects: Algorithms; Probability distribution; Sampling
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/s41598-023-45133-z

In Noisy Intermediate-Scale Quantum (NISQ) era, the scarcity of qubit resources has prevented many quantum algorithms from being implemented on quantum devices. Circuit cutting technology has greatly alleviated this problem, which allows us to run larger quantum circuits on real quantum machines with currently limited qubit resources at the cost of additional classical overhead. However, the classical overhead of circuit cutting grows exponentially with the number of cuts and qubits, and the excessive postprocessing overhead makes it difficult to apply circuit cutting to large scale circuits. In this paper, we propose a fast reconstruction algorithm based on Hamiltonian Monte Carlo (HMC) sampling, which samples the high probability solutions by Hamiltonian dynamics from state space with dimension growing exponentially with qubit. Our algorithm avoids excessive computation when reconstructing the original circuit probability distribution, and greatly reduces the circuit cutting post-processing overhead. The improvement is crucial for expanding of circuit cutting to a larger scale on NISQ devices.