A Sparse and Truncated State Vector Simulator for Peaked Circuits
Abstract
Peaked quantum circuits can be efficiently simulated classically using sparse state vector representations with vectorized operations and hardware acceleration.
In a class of quantum circuits known as peaked circuits, the goal is to predict the most probable bit string at the output of the circuit. Since these circuits are designed to have a sharp peak in their output distribution, in principle it should be possible to simulate them using a truncated state vector with a limited number of terms, or a fraction of the total probability mass. This approximate simulation can be carried out on a classical computer with a sparse representation that stores only the nonzero amplitudes of the state vector, in contrast to the dense representations that are common in most quantum simulators. For efficiency, all operations on the state vector should be vectorized to the furthest possible extent and, if available, hardware acceleration can also be used. This work describes how these requirements were met in an open-source implementation, and discusses its performance and limitations.
Community
Introduces a sparse and truncated state‑vector simulator for peaked quantum circuits, where the goal is to find the most probable output bit string. By storing only nonzero amplitudes and by vectorizing all operations (with optional GPU acceleration), this open‑source implementation enables approximate classical simulation beyond the memory limits of dense state-vector representations.
This is an automated message from the Librarian Bot. I found the following papers similar to this paper.
The following papers were recommended by the Semantic Scholar API
- Simulating quantum circuits with a neural statebank (2026)
- Basis-Adaptive Sparse-State Simulation of Quantum Circuits (2026)
- Not Your Usual FFT: QFT$\rightarrow$FFT via Classical Quantum-Circuit Simulation (2026)
- Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks (2026)
- PauLIB: A High-Performance Library for Processing Pauli Strings (2026)
- Half the Interference, Most of the Answer: Approximate Quantum Simulation via Path-Sum Pruning (2026)
- Bowtie VarQTE: A Resource-Efficient Quantum State Preparation Primitive (2026)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on Hugging Face checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend
Get this paper in your agent:
hf papers read 2607.07816 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper