Jul 2026· International Conference on Supercomputing· pp. 1296-1309· 1 citation· ⚡ 1 influential· 86 references
Computer Science
TL;DR
This paper presents a scalable quantum circuit simulation that extends the conventional stabilizer tableau formalism to support mixed Clifford and non-Clifford operations on multi-GPU platforms, and introduces a dynamically extensible tableau representation that eliminates destabilizer redundancy.
Abstract
Efficient simulation of large-scale quantum circuits remains a critical bottleneck in quantum computing research, as the exponential memory and runtime growth of state vector-based approaches limits scalability beyond tens of qubits. This paper presents a scalable quantum circuit simulation that extends the conventional stabilizer tableau formalism to support mixed Clifford and non-Clifford operations on multi-GPU platforms. The proposed quantum simulation introduces a dynamically extensible tableau representation that eliminates destabilizer redundancy and distributes independent Pauli groups across GPUs for fine-grained parallelism. A two-stage CUDA kernel pipeline efficiently manages the branching and merging of tableau rows during non-Clifford evolution by separating counting required rows from row updates, ensuring deterministic updates and compact memory usage. Comprehensive evaluations on 128 circuits from QASMBench demonstrate that the proposed simulation achieves 78.1% overall coverage, executing many non-Clifford circuits that other simulators failed to complete. Compared with state vector-based frameworks, our simulation reduces peak memory consumption by up to 10126 × and maintains stable multi-GPU scalability, successfully executing circuits up to 30000 qubits.
Quantum computing has the potential to accelerate various fields by solving specific problems significantly faster than classical computers. Solving more complex problems generally requires a larger number of qubits. However, current quantum devices are constrained by limited qubit counts and environmental noise. Quant...
Po-Hsuan Huang, Chun-Yen Tai, Chia-Heng Tu et al.· ACM Transactions on Design A...· 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
As quantum computing continues to demonstrate promise and attract growing attention, there is an increasing need for more precise experiments to advance the development of quantum devices, as well as higher circuit throughput to validate more domain applications. However, this need is hindered by a memory bottleneck at...
Yicheng Guang, Neel Vora, Yilun Xu et al.· 1 citation
It is demonstrated that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types, and it is found that MPS efficiency depends sensitively on implementation choices.
A. Orioli, Chen Zhao, G. Masella et al.· 2 citations
This work shows that the compilation method Parity Twine perfectly complements the hardware's capabilities to perform tasks such as the quantum Fourier transform or QAOA, and describes an error detection technique native to Parity Twine, which EO qubits can leverage in a unique and advantageous way to improve algorithm...
F. Lohof, Florian Ginzel, Wolfgang Lechner· 0 citations
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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.