Predicting properties of Scrooge ensembles with high accuracy and low sample complexity
Abstract
The Scrooge ensemble associated with a density matrix ρ is the maximally random ensemble whose average density matrix is ρ. It has attracted growing interest for its applications to quantum many-body dynamics and quantum information. The intrinsic statistical properties of the Scrooge ensembles are encoded in their higher-order moments, yet they are nontrivial to analyze and prepare for they feature a non-polynomial Haar integrand, blocking direct use of Haar integration machinery. Existing physical mechanisms to sample multiple copies of states from the Scrooge ensembles, meanwhile, typically require costly postselection, rendering them inefficient for large system size. In this work, we develop efficient and accurate methods for analyzing and implementing Scrooge moments. We first introduce a polynomial approximation to the Scrooge k-th moments whose error is tunable down to a threshold that improves from inverse polynomial to exponential in 1/||ρ||∞ over previous results. Building on our approximation, we then give the first efficient quantum algorithm that estimates observable expectation values using 𝒪̃(k3/ε5) copies of ρ for any target error ε above this threshold. We further provide a construction of a block encoding of the Scrooge k-th moment when the preparation circuit of ρ is known. Of independent interest could be a key subroutine in our algorithms, which efficiently implements projection onto the k-fold symmetric subspace for ρ⊗ k using 𝒪(k3/ε2) samples of ρ, avoiding the naive k! postselection cost of such a projection. These results provide new tools for both the theoretical analysis and practical prediction of properties of Scrooge ensembles, with potential applications to quantum many-body dynamics and quantum information processing.
Related
- Spectral properties of deterministic matrices multiplied by rotationally invariant random non-Hermitian ensembles
- Modular Properties of W3 Generalised Gibbs Ensembles
- Modular Properties of Generalised Gibbs Ensembles: The Deformed KdV Hierarchy
- Arbitrary-Accuracy Neural Approximation with Optimal Neuron Count and Near-Optimal Bit Complexity
- The Moreau-Yosida approximation of the Entanglement of Formation: basic properties and accuracy estimates
BibTeX
@misc{wu2026predicting,
title = {{Predicting properties of Scrooge ensembles with high accuracy and low sample complexity}},
author = {Yue Wu and Yuzhi Tong and Helen Propson and Yihui Quek and Liang Mao},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.39992},
eprint = {2609.39992},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39992},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Predicting properties of Scrooge ensembles with high accuracy and low sample complexity
AU - Yue Wu
AU - Yuzhi Tong
AU - Helen Propson
AU - Yihui Quek
AU - Liang Mao
PY - 2026
DA - 2026/10/02
PB - arXiv
DO - 10.48550/arxiv.2609.39992
UR - https://arxiv.org/abs/2609.39992
AB - The Scrooge ensemble associated with a density matrix ρ is the maximally random ensemble whose average density matrix is ρ. It has attracted growing interest for its applications to quantum many-body dynamics and quantum information. The intrinsic statistical properties of the Scrooge ensembles are encoded in their higher-order moments, yet they are nontrivial to analyze and prepare for they feature a non-polynomial Haar integrand, blocking direct use of Haar integration machinery. Existing physical mechanisms to sample multiple copies of states from the Scrooge ensembles, meanwhile, typically require costly postselection, rendering them inefficient for large system size. In this work, we develop efficient and accurate methods for analyzing and implementing Scrooge moments. We first introduce a polynomial approximation to the Scrooge k-th moments whose error is tunable down to a threshold that improves from inverse polynomial to exponential in 1/||ρ||_∞ over previous results. Building on our approximation, we then give the first efficient quantum algorithm that estimates observable expectation values using 𝒪̃(k^3/ε^5) copies of ρ for any target error ε above this threshold. We further provide a construction of a block encoding of the Scrooge k-th moment when the preparation circuit of ρ is known. Of independent interest could be a key subroutine in our algorithms, which efficiently implements projection onto the k-fold symmetric subspace for ρ^⊗ k using 𝒪(k^3/ε^2) samples of ρ, avoiding the naive k! postselection cost of such a projection. These results provide new tools for both the theoretical analysis and practical prediction of properties of Scrooge ensembles, with potential applications to quantum many-body dynamics and quantum information processing.
ER -