Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2509.24842

Near-Optimal Simultaneous Estimation of Quantum State Moments

Xiao Lei Shi, Jiyu Jiang, Xiong Wu, Jingui Xie, Hongshun Yao, Xin Wang

Published Sep 29, 2025• 6 citations
arXivHTMLPDF

Abstract

Estimating nonlinear properties such as Rényi entropies and observable-weighted moments serves as a central strategy for spectrum spectroscopy, which is fundamental to property prediction and analysis in quantum information science, statistical mechanics, and many-body physics. However, existing approaches are susceptible to noise and require significant resources, making them challenging for near-term quantum hardware. In this work, we introduce a framework for resource-efficient simultaneous estimation of quantum state moments via qubit reuse. For an $m$-qubit quantum state $ρ$, our method achieves the simultaneous estimation of the full hierarchy of moments $\text{Tr}(ρ^2), \dots, \text{Tr}(ρ^k)$, as well as arbitrary polynomial functionals and their observable-weighted counterparts. By leveraging qubit reset operations, our core circuit for simultaneous moment estimation requires only $2m+1$ physical qubits and $\mathcal{O}(k)$ CSWAP gates, achieving a near-optimal sample complexity of $\mathcal{O}(k \log k / \varepsilon^2)$. We demonstrate this protocol's utility by showing that the estimated moments yield tight bounds on a state's maximum eigenvalue and present applications in quantum virtual cooling to access low-energy states of the Heisenberg model. Furthermore, we show the protocol's viability on near-term quantum hardware by experimentally measuring higher-order Rényi entropy on a superconducting quantum processor. Our method provides a scalable and resource-efficient route to quantum system characterization and spectroscopy on near-term quantum hardware.

DOI
10.48550/arxiv.2509.24842

Related papers

Resource-efficient algorithm for estimating the trace of quantum state powers

Myeongjin Shin, Junseo Lee, Seungwoo Lee +1 more

Estimating the trace of quantum state powers, Tr ( ρ k ) , for k identical quantum states is a fundamental task with numerous applications in quantum information processing, including nonlinear function estimation of quantum states and entanglement detection. On near-term quantum devices, reducing the required quantum circuit depth, the number of multi-qubit quantum operations, and the copies of the quantum state needed for such computations is crucial. In this work, inspired by the Newton-Girard method, we significantly improve upon existing results by introducing an algorithm that requires only O ( r ~ ) qubits and O ( r ~ ) multi-qubit gates, where r ~ = min { rank ( ρ ) , ⌈ ln ⁡ ( 2 k / ϵ ) ⌉ } . This approach is efficient, as it employs the r ~ -entangled copy measurement instead of the conventional k -entangled copy measurement, while asymptotically preserving the known sample complexity upper bound. Furthermore, we prove that estimating { Tr ( ρ i ) } i = 1 r ~ is sufficient to approximate Tr ( ρ k ) even for large integers k > r ~ . This leads to a rank-dependent complexity for solving the problem, providing an efficient algorithm for low-rank quantum states while also improving existing methods when the rank is unknown or when the state is not low-rank. Building upon these advantages, we extend our algorithm to the estimation of Tr ( M ρ k ) for arbitrary observables and Tr ( ρ k σ l ) for multiple quantum states.

arXiv:2408.00314•Quantum•Aug 27, 2025•18 citations

Quantum Nonlinear Properties from a Single Measurement Setting

Zihao Li, Datong Chen, Dayue Qin +2 more

Nonlinear properties of quantum states are essential to quantum information and many-body physics, but assessing them experimentally is challenging, as it typically requires multi-copy operations or a large number of measurement settings. To address this challenge, we develop a universal framework, collision-based nonlinear estimation (CBNE), for efficiently measuring nonlinear quantities of a quantum state $ρ$, such as the higher-order expectation value ${\rm tr}(Oρ^t)$ for some observable $O$, using single-copy randomized measurements. Strikingly, our protocol requires only a single measurement setting, provided that the system dimension is sufficiently large or a few ancillary qubits are available; this contrasts with the conventional expectation that multiple measurement bases are necessary for nonlinear estimation. In addition, CBNE is observable-independent at the experimental stage, which enables simultaneous estimation of multiple nonlinear functions. It further extends to broader tasks, including the estimation of principal component properties and partial-transpose moments of quantum states. Our results provide a practical and scalable route for measuring nonlinear state properties on near-term quantum devices.

quant-pharXiv:2605.09958•May 12, 2026•5 citations

Simultaneous Estimation of Nonlinear Functionals of a Quantum State

Kean Chen, Qisheng Wang, Yu Zhan +1 more

We consider a fundamental task in quantum information theory, estimating the values of tr(Oρ), tr(Oρ2), . . . , tr(Oρk) for an observableOand a quantum state ρ. We show that Θ(k) samples of ρ are sufficient and necessary to simultaneously estimate all thekvalues. This means that estimating all thekvalues is almost as easy as estimating only one of them, tr(Oρk). As an application, our approach advances the sample complexity of entanglement spectroscopy and the virtual cooling for quantum many-body systems. Moreover, we extend our approach to estimating general functionals by polynomial approximation.

arXiv:2505.16715•IEEE Transactions on Information Theory•Jun 4, 2026•19 citations

Optimal single-copy estimation of quantum state moments: why $\operatorname{Tr}(ρ^3)$ and $\operatorname{Tr}(ρ^4)$ are equally hard

Zhenhuan Liu

Estimating nonlinear properties of an unknown quantum state with restrictive experimental accessibility is a fundamental problem in quantum learning. We study the sample complexity of estimating the state moments $\operatorname{Tr}(ρ^t)$, allowing arbitrary adaptive single-copy measurements. While purity estimation has optimal sample complexity $Θ(\sqrt d)$ at constant additive error, the optimal dimension dependence for higher moments has remained unclear. We resolve this question for every fixed integer $t\ge 2$: for any sufficiently small constant additive error, the optimal sample complexity is \[ Θ\!\left(d^{\frac{\lceil\log_2 t\rceil}{1+\lceil\log_2 t\rceil}}\right) \] with constant success probability. The complexity thus follows a dyadic hierarchy: for each integer $h\geq1$, all moment orders $2^{h-1}<t\leq2^h$ share the same exponent. In particular, the third and fourth moments both require $Θ(d^{2/3})$ copies. Our results also apply to multistate overlaps, weighted and partial-transpose moments, fixed-rank spectrum estimation, and distributed estimation of nonlinear quantities. We also establish an $Ω(d^{1-1/t})$ lower bound for arbitrary nonadaptive single-copy protocols, matching the known upper bound and demonstrating an advantage from adaptivity for every $t\geq4$. Our upper bound uses adaptive state filtering to reduce higher-order moment estimation to lower-order moment estimation in a smaller state space. For the lower bound, we directly compare moment-matched ensembles through a smooth interpolation, bypassing the maximally mixed state as an intermediate hypothesis and yielding matching bounds beyond $\sqrt d$.

quant-pharXiv:2609.37781•Sep 30, 2026•1 citation

Robust Shadow Estimation

Senrui Chen, Wenjun Yu, Pei Zeng +1 more

Efficiently estimating properties of large and strongly coupled quantum systems is a central focus in many-body physics and quantum information theory. While quantum computers promise speedups for many of these tasks, near-term devices are prone to noise that will generally reduce the accuracy of such estimates. Here, we propose a sample-efficient and noise-resilient protocol for learning properties of quantum states building on the shadow estimation scheme [Huang et al., Nature Physics 16, 1050-1057 (2020)]. By introducing an experimentally friendly calibration procedure, our protocol can efficiently characterize and mitigate noises in the shadow estimation scheme, given only minimal assumptions on the experimental conditions. When the strength of noises can be bounded, our protocol approximately retains the same order of sample efficiency as the standard shadow estimation scheme, while also possessing a provable noise resilience. We give rigorous bounds on the sample complexity of our protocol and demonstrate its performance with several numerical experiments, including estimations of quantum fidelity, correlation functions and energy expectations, etc., which highlight a wide spectrum of potential applications of our protocol on near-term devices.

•Sep 22, 2021•14 citations

Random Projections for Multi-Copy Quantum Algorithms

Xiaoyu Liu, Jordi Tura, Johannes Knörzer

Estimating nonlinear properties of quantum states is a central task in quantum information science. Multivariate traces, $\mathrm{tr}(ρ_1 \cdots ρ_K)$, and nonlinear observables such as $\mathrm{tr}(ρ^K)$, for integer $K$, can be accessed through collective measurements on multiple state copies, but standard protocols based on swap tests require coherent operations on the full Hilbert space and become experimentally unfeasible for large systems. In this work, we introduce a framework for multi-copy measurements based on random projections onto lower-dimensional subspaces prior to the collective measurement, which is then performed only on the reduced Hilbert space. This procedure yields a tunable tradeoff between coherent quantum resources and statistical sampling overhead, allowing the amount of coherent processing to be matched to the capabilities of the underlying hardware. We derive explicit formulas relating the Haar-averaged projected moments to multivariate traces of the original states and analyze the sampling overhead induced by the projection procedure. Specifically, after compressing an $n$-qubit state to a reduced $q$-qubit subspace, estimating $\mathrm{tr}(ρ^K)$ requires approximately $O(2^{(n-q)(K-1)})$ copies of $ρ$, with each qubit projected out increasing the sampling cost by a factor of $2^{K-1}$. Our results establish how coherent multi-copy operations can be traded for additional state copies, enabling multi-copy quantum protocols to be optimized for the available hardware resources.

quant-pharXiv:2606.20238•Jun 19, 2026•0 citations
Estimating nonlinear properties such as Rényi entropies and observable-weighted moments serves as a central strategy for spectrum spectroscopy, which is fundamental to property prediction and analysis in quantum information science, statistical mechanics, and many-body physics. However, existing approaches are susceptible to noise and require significant resources, making them challenging for near-term quantum hardware. In this work, we introduce a framework for resource-efficient simultaneous estimation of quantum state moments via qubit reuse. For an mmm-qubit quantum state ρρρ, our method achieves the simultaneous estimation of the full hierarchy of moments Tr(ρ2),…,Tr(ρk)\text{Tr}(ρ^2), \dots, \text{Tr}(ρ^k)Tr(ρ2),…,Tr(ρk), as well as arbitrary polynomial functionals and their observable-weighted counterparts. By leveraging qubit reset operations, our core circuit for simultaneous moment estimation requires only 2m+12m+12m+1 physical qubits and O(k)\mathcal{O}(k)O(k) CSWAP gates, achieving a near-optimal sample complexity of O(klog⁡k/ε2)\mathcal{O}(k \log k / \varepsilon^2)O(klogk/ε2). We demonstrate this protocol's utility by showing that the estimated moments yield tight bounds on a state's maximum eigenvalue and present applications in quantum virtual cooling to access low-energy states of the Heisenberg model. Furthermore, we show the protocol's viability on near-term quantum hardware by experimentally measuring higher-order Rényi entropy on a superconducting quantum processor. Our method provides a scalable and resource-efficient route to quantum system characterization and spectroscopy on near-term quantum hardware.
Estimating the trace of quantum state powers, Tr ( ρ k ) , for k identical quantum states is a fundamental task with numerous applications in quantum information processing, including nonlinear function estimation of quantum states and entanglement detection. On near-term quantum devices, reducing the required quantum circuit depth, the number of multi-qubit quantum operations, and the copies of the quantum state needed for such computations is crucial. In this work, inspired by the Newton-Girard method, we significantly improve upon existing results by introducing an algorithm that requires only O ( r ~ ) qubits and O ( r ~ ) multi-qubit gates, where r ~ = min { rank ( ρ ) , ⌈ ln ⁡ ( 2 k / ϵ ) ⌉ } . This approach is efficient, as it employs the r ~ -entangled copy measurement instead of the conventional k -entangled copy measurement, while asymptotically preserving the known sample complexity upper bound. Furthermore, we prove that estimating { Tr ( ρ i ) } i = 1 r ~ is sufficient to approximate Tr ( ρ k ) even for large integers k > r ~ . This leads to a rank-dependent complexity for solving the problem, providing an efficient algorithm for low-rank quantum states while also improving existing methods when the rank is unknown or when the state is not low-rank. Building upon these advantages, we extend our algorithm to the estimation of Tr ( M ρ k ) for arbitrary observables and Tr ( ρ k σ l ) for multiple quantum states.
Nonlinear properties of quantum states are essential to quantum information and many-body physics, but assessing them experimentally is challenging, as it typically requires multi-copy operations or a large number of measurement settings. To address this challenge, we develop a universal framework, collision-based nonlinear estimation (CBNE), for efficiently measuring nonlinear quantities of a quantum state ρρρ, such as the higher-order expectation value tr(Oρt){\rm tr}(Oρ^t)tr(Oρt) for some observable OOO, using single-copy randomized measurements. Strikingly, our protocol requires only a single measurement setting, provided that the system dimension is sufficiently large or a few ancillary qubits are available; this contrasts with the conventional expectation that multiple measurement bases are necessary for nonlinear estimation. In addition, CBNE is observable-independent at the experimental stage, which enables simultaneous estimation of multiple nonlinear functions. It further extends to broader tasks, including the estimation of principal component properties and partial-transpose moments of quantum states. Our results provide a practical and scalable route for measuring nonlinear state properties on near-term quantum devices.
We consider a fundamental task in quantum information theory, estimating the values of tr(Oρ), tr(Oρ2), . . . , tr(Oρk) for an observableOand a quantum state ρ. We show that Θ(k) samples of ρ are sufficient and necessary to simultaneously estimate all thekvalues. This means that estimating all thekvalues is almost as easy as estimating only one of them, tr(Oρk). As an application, our approach advances the sample complexity of entanglement spectroscopy and the virtual cooling for quantum many-body systems. Moreover, we extend our approach to estimating general functionals by polynomial approximation.
Optimal single-copy estimation of quantum state moments: why Tr⁡(ρ3)\operatorname{Tr}(ρ^3)Tr(ρ3) and Tr⁡(ρ4)\operatorname{Tr}(ρ^4)Tr(ρ4) are equally hard
Estimating nonlinear properties of an unknown quantum state with restrictive experimental accessibility is a fundamental problem in quantum learning. We study the sample complexity of estimating the state moments Tr⁡(ρt)\operatorname{Tr}(ρ^t)Tr(ρt), allowing arbitrary adaptive single-copy measurements. While purity estimation has optimal sample complexity Θ(d)Θ(\sqrt d)Θ(d​) at constant additive error, the optimal dimension dependence for higher moments has remained unclear. We resolve this question for every fixed integer t≥2t\ge 2t≥2: for any sufficiently small constant additive error, the optimal sample complexity is Θ ⁣(d⌈log⁡2t⌉1+⌈log⁡2t⌉) Θ\!\left(d^{\frac{\lceil\log_2 t\rceil}{1+\lceil\log_2 t\rceil}}\right) Θ(d1+⌈log2​t⌉⌈log2​t⌉​) with constant success probability. The complexity thus follows a dyadic hierarchy: for each integer h≥1h\geq1h≥1, all moment orders 2h−1<t≤2h2^{h-1}<t\leq2^h2h−1<t≤2h share the same exponent. In particular, the third and fourth moments both require Θ(d2/3)Θ(d^{2/3})Θ(d2/3) copies. Our results also apply to multistate overlaps, weighted and partial-transpose moments, fixed-rank spectrum estimation, and distributed estimation of nonlinear quantities. We also establish an Ω(d1−1/t)Ω(d^{1-1/t})Ω(d1−1/t) lower bound for arbitrary nonadaptive single-copy protocols, matching the known upper bound and demonstrating an advantage from adaptivity for every t≥4t\geq4t≥4. Our upper bound uses adaptive state filtering to reduce higher-order moment estimation to lower-order moment estimation in a smaller state space. For the lower bound, we directly compare moment-matched ensembles through a smooth interpolation, bypassing the maximally mixed state as an intermediate hypothesis and yielding matching bounds beyond d\sqrt dd​.
Efficiently estimating properties of large and strongly coupled quantum systems is a central focus in many-body physics and quantum information theory. While quantum computers promise speedups for many of these tasks, near-term devices are prone to noise that will generally reduce the accuracy of such estimates. Here, we propose a sample-efficient and noise-resilient protocol for learning properties of quantum states building on the shadow estimation scheme [Huang et al., Nature Physics 16, 1050-1057 (2020)]. By introducing an experimentally friendly calibration procedure, our protocol can efficiently characterize and mitigate noises in the shadow estimation scheme, given only minimal assumptions on the experimental conditions. When the strength of noises can be bounded, our protocol approximately retains the same order of sample efficiency as the standard shadow estimation scheme, while also possessing a provable noise resilience. We give rigorous bounds on the sample complexity of our protocol and demonstrate its performance with several numerical experiments, including estimations of quantum fidelity, correlation functions and energy expectations, etc., which highlight a wide spectrum of potential applications of our protocol on near-term devices.
Estimating nonlinear properties of quantum states is a central task in quantum information science. Multivariate traces, tr(ρ1⋯ρK)\mathrm{tr}(ρ_1 \cdots ρ_K)tr(ρ1​⋯ρK​), and nonlinear observables such as tr(ρK)\mathrm{tr}(ρ^K)tr(ρK), for integer KKK, can be accessed through collective measurements on multiple state copies, but standard protocols based on swap tests require coherent operations on the full Hilbert space and become experimentally unfeasible for large systems. In this work, we introduce a framework for multi-copy measurements based on random projections onto lower-dimensional subspaces prior to the collective measurement, which is then performed only on the reduced Hilbert space. This procedure yields a tunable tradeoff between coherent quantum resources and statistical sampling overhead, allowing the amount of coherent processing to be matched to the capabilities of the underlying hardware. We derive explicit formulas relating the Haar-averaged projected moments to multivariate traces of the original states and analyze the sampling overhead induced by the projection procedure. Specifically, after compressing an nnn-qubit state to a reduced qqq-qubit subspace, estimating tr(ρK)\mathrm{tr}(ρ^K)tr(ρK) requires approximately O(2(n−q)(K−1))O(2^{(n-q)(K-1)})O(2(n−q)(K−1)) copies of ρρρ, with each qubit projected out increasing the sampling cost by a factor of 2K−12^{K-1}2K−1. Our results establish how coherent multi-copy operations can be traded for additional state copies, enabling multi-copy quantum protocols to be optimized for the available hardware resources.