Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.00951 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915905870495744 |
|---|---|
| author | Chen, Yongkai Ma, Ping Zhong, Wenxuan |
| author_facet | Chen, Yongkai Ma, Ping Zhong, Wenxuan |
| contents | The bootstrap is a foundational tool in statistical inference, but its classical implementation relies on Monte Carlo resampling, introducing approximation error and incurring high computational cost -- especially for large datasets and complex models. We present the Quantum Bootstrap (QBOOT), a quantum algorithm that computes the ideal bootstrap estimate exactly by encoding all possible resamples in quantum superposition, evaluating the target statistic in parallel, and extracting the aggregate via quantum amplitude estimation. Under mild circuit efficiency assumptions, QBOOT achieves a near-quadratic speedup over the classical bootstrap in approximating the ideal estimator, independent of the statistic or underlying distribution. We provide a rigorous theoretical analysis of its statistical error properties -- addressing a gap in the quantum algorithms literature -- and validate our results through experiments on the IBM quantum simulator for the sample mean problem. Our findings demonstrate that QBOOT preserves the asymptotic properties of the ideal bootstrap while substantially improving computational efficiency and precision, establishing a scalable and principled framework for quantum statistical inference. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_00951 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Quantum Statistical Bootstrap Chen, Yongkai Ma, Ping Zhong, Wenxuan Computation The bootstrap is a foundational tool in statistical inference, but its classical implementation relies on Monte Carlo resampling, introducing approximation error and incurring high computational cost -- especially for large datasets and complex models. We present the Quantum Bootstrap (QBOOT), a quantum algorithm that computes the ideal bootstrap estimate exactly by encoding all possible resamples in quantum superposition, evaluating the target statistic in parallel, and extracting the aggregate via quantum amplitude estimation. Under mild circuit efficiency assumptions, QBOOT achieves a near-quadratic speedup over the classical bootstrap in approximating the ideal estimator, independent of the statistic or underlying distribution. We provide a rigorous theoretical analysis of its statistical error properties -- addressing a gap in the quantum algorithms literature -- and validate our results through experiments on the IBM quantum simulator for the sample mean problem. Our findings demonstrate that QBOOT preserves the asymptotic properties of the ideal bootstrap while substantially improving computational efficiency and precision, establishing a scalable and principled framework for quantum statistical inference. |
| title | Quantum Statistical Bootstrap |
| topic | Computation |
| url | https://arxiv.org/abs/2604.00951 |