Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
arXiv:2510.24218 · doi:10.22331/q-2026-07-23-2173
Abstract
Quantum circuit simulators running on classical computers offer a vital platform for designing, testing, and optimizing quantum algorithms, driving innovation despite limited access to real quantum hardware. However, their scalability is inherently constrained by exponential memory and computational overhead, which restricts accurate simulation of large-scale quantum circuits and often results in approximate output distributions. Here, we propose an exact sampling algorithm that integrates tensor network contraction techniques with a Markov process, wherein a classical state evolves according to the local structure of the quantum circuit. As a demonstration, we target the challenge of generating samples from ideal and noisy QAOA circuits with up to 476 qubits, incorporating both depolarizing and amplitude damping noise models. These results enable further validation of several assumptions and conjectures at a scale previously out of reach, significantly expanding the scope of classical simulation in quantum algorithm research.
References in corpus (33)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Efficient classical simulation of slightly entangled quantum computations
- A Quantum Approximate Optimization Algorithm
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum error correction below the surface code threshold
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- Architectural considerations in the design of a superconducting quantum annealing processor
- Warm-starting quantum optimization
- What limits the simulation of quantum computers?
- Hyper-optimized tensor network contraction
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Full-State Quantum Circuit Simulation by Using Data Compression
- Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
- Density-matrix simulation of small surface codes under current and projected experimental noise
- A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
- Efficient tensor network simulation of IBM's largest quantum processors
- Parameter Setting in Quantum Approximate Optimization of Weighted Problems
- GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
- Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
- Quantum Approximate Optimization Algorithm pseudo-Boltzmann states
- How to simulate quantum measurement without computing marginals
- Benchmarking Quantum Computer Simulation Software Packages: State Vector Simulators
- Quantum Computing Dataset of Maximum Independent Set Problem on King's Lattice of over Hundred Rydberg Atoms
- Pauli path simulations of noisy quantum circuits beyond average case
- A space-efficient quantum computer simulator suitable for high-speed FPGA implementation
- Multi-Tensor Contraction for XEB Verification of Quantum Circuits
- Connection between single-layer Quantum Approximate Optimization Algorithm interferometry and thermal distributions sampling
- Universal Resources for QAOA and Quantum Annealing
- BGLS: A Python Package for the Gate-by-Gate Sampling Algorithm to Simulate Quantum Circuits
- Pilot-wave quantum theory in discrete space and time and the principle of least action
- Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits
- Strategies for running the QAOA at hundreds of qubits
- Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm