It is shown that HPC-oriented heterogeneous reconstruction can effectively alleviate the classical post-processing bottleneck and improve reconstruction scalability and results demonstrate that HPC-oriented heterogeneous reconstruction can effectively alleviate the classical post-processing bottleneck and improve reconstruction scalability.
Abstract
In the NISQ era, limited qubit resources make it difficult to execute large quantum circuits directly on real hardware. Quantum circuit cutting mitigates this limitation by decomposing a large circuit into smaller subcircuits, but it shifts substantial overhead to classical post-processing. As circuit size, complexity, and cut count increase, reconstruction becomes a major computational and storage bottleneck. This paper presents a CPU+DCU heterogeneous parallel framework for circuit-cutting post-processing reconstruction. Instead of constructing a dense $2^n$-dimensional probability vector or returning only high-probability states, the framework reconstructs the nonzero-probability states in the original output distribution from subcircuit measurement results. It combines heterogeneous CPU+DCU execution with a high/low-word integer representation for global basis-state indices beyond 64 bits and a three-level cooperative storage mechanism spanning device memory, host memory, and out-of-core storage. Experiments on the Songshan supercomputer show that the framework maintains high reconstruction fidelity while achieving up to $259\times$ speedup over an optimized serial baseline on linear-cluster states and up to $4\times$ speedup over a homogeneous CPU-parallel method on random circuits. The framework can also complete reconstruction tasks at the hundred-qubit scale. These results demonstrate that HPC-oriented heterogeneous reconstruction can effectively alleviate the classical post-processing bottleneck and improve reconstruction scalability.
The realization of practical quantum advantage requires executing large-scale circuits that far exceed the qubit capacity of any single quantum processor. To address this, two primary scaling strategies have emerged: circuit cutting, which utilizes classical resources to decompose circuits into smaller fragments, and m...
Ze-Fan Du, Wen-Rui Zhang, Jake Gesseck et al.· IEEE International Conferenc...· 0 citations
The results show that circuit-level parallelism can reduce execution cost on current quantum hardware and simulation time on GPU clusters, with the potential for greater benefits as device quality and qubit counts increase.
Avimita Chatterjee, W. M. Brown, Si-Yuan Niu et al.· 0 citations
Sample-based Krylov quantum diagonalization is analyzed under depolarizing noise, deriving shot-count resource estimates that expose an exponential depth penalty, and experiments on current noisy hardware with the one-dimensional single-impurity Anderson model on a 20-site (40-qubit) instance are performed.
M. Grandadam, V. Bohun, Dikshant Dulal et al.· 0 citations
An end-to-end real-time decoding stack for a universal fault-tolerant trapped-ion quantum computer architecture capable of decoding real workloads with millions of logical gates over hundreds of logical qubits is demonstrated.
Min Ye, Andrii O. Maksymov, Nicolas Delfosse· 2 citations
Quantum processing of classical data fundamentally relies on efficiently mapping classical datasets onto the amplitudes of quantum states. Preparing large amplitude-encoded states, however, remains a major bottleneck in quantum computing. In this paper, we introduce a novel state-preparation framework we call Q-MERGE,...
A low-overhead fidelity-aware scheduling framework for multi-QPU systems based on a Graph Neural Network that estimates, before compilation, the expected fidelity of each circuit on each available QPU, and a tunable scheduler uses these estimates to control the trade-off between execution fidelity and parallelism.
Innocenzo Fulginiti, Antonio Tudisco, Salvatore Zammuto et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.