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:2611.10330

Adaptive Protocol for Rényi Entropy Estimation

Mu Niu, Yi Hong Teoh, Roger G. Melko, Rajibul Islam

Published Nov 6, 2026• 0 citations
arXivHTMLPDF

Abstract

The second-order Rényi entropy is one of the most important quantities used for characterizing the entanglement structure of states prepared in quantum many-body experiments. With access to qubit projective measurement data, it can be estimated via a protocol in which repeated measurements are taken after each of a set of random local unitary operations is applied to the quantum state. To obtain accurate values for the second Rényi entropy on shot-limited devices, care must be taken when choosing the number of different unitary settings to apply, and the respective number of projective measurements to take. In this paper, we propose an adaptive protocol for estimating the Rényi entropy that iteratively optimizes the ratio of basis settings to measurements, using a gradient-based approach and starting from an initial small set of measurements. Using synthetic data, we demonstrate that for several prototypical states, our method converges to values for this ratio that are comparable to the optimal values obtained by a brute-force grid search, and it exhibits slower growth of the measurement budget required for a fixed target accuracy than fixed-ratio protocols. Our adaptive protocol therefore promotes efficient estimation of the Rényi entropy in finite-size, shot-limited quantum experiments by making effective use of the available measurement budget.

DOI
10.48550/arxiv.2611.10330

Related papers

Probing Rényi entanglement entropy via randomized measurements

Tiff Brydges, Andreas Elben, Petar Jurcevic +6 more

Entanglement is a key feature of many-body quantum systems. Measuring the entropy of different partitions of a quantum system provides a way to probe its entanglement structure. Here, we present and experimentally demonstrate a protocol for measuring the second-order Rényi entropy based on statistical correlations between randomized measurements. Our experiments, carried out with a trapped-ion quantum simulator with partition sizes of up to 10 qubits, prove the overall coherent character of the system dynamics and reveal the growth of entanglement between its parts, in both the absence and presence of disorder. Our protocol represents a universal tool for probing and characterizing engineered quantum systems in the laboratory, which is applicable to arbitrary quantum states of up to several tens of qubits.

arXiv:1806.05747•Science•Apr 19, 2019•711 citations

Estimation of nonlinear physical quantities by measuring ancillas

Nhat A. Nghiem, Tzu-Chieh Wei

In this article, we present quantum algorithms for estimating von Neumann entropy and Renyi entropy, which are crucial physical and information-theoretical properties of a given quantum state $\ensuremath{\rho}$. Although there have been existing works that have achieved the same goal, some prior developments assume the unitary that prepares the purification to the target state $\ensuremath{\rho}$. Here, we consider an alternative setting where only copies of $\ensuremath{\rho}$ are given and we construct a quantum algorithm that estimates the desired entropy. Our framework completes the given task by measuring a small number of ancilla qubits without directly measuring the system, and it achieves significant improvement over prior relevant developments. For example, for the Renyi entropy of the order of nonintegral $\ensuremath{\alpha}$, our method achieves almost a power-of-2 improvement in sample complexity with respect to the rank of the given state and almost a power-of-2 improvement in error tolerance compared with the work by Wang et al. [Y. Wang, B. Zhao, and X. Wang, Phys. Rev. Appl. 19, 044041 (2023)].

arXiv:2502.07571•Physical Review A•Nov 17, 2025•2 citations

Measuring Renyi Entanglement Entropy in Quantum Monte Carlo Simulations

Matthew B. Hastings, Iván González, Ann B. Kallin +1 more

We develop a quantum Monte Carlo procedure, in the valence bond basis, to measure the Renyi entanglement entropy of a many-body ground state as the expectation value of a unitary Swap operator acting on two copies of the system. An improved estimator involving the ratio of Swap operators for different subregions enables convergence of the entropy in a simulation time polynomial in the system size. We demonstrate convergence of the Renyi entropy to exact results for a Heisenberg chain. Finally, we calculate the scaling of the Renyi entropy in the two-dimensional Heisenberg model and confirm that the Néel ground state obeys the expected area law for systems up to linear size L=32.

arXiv:1001.2335•Physical Review Letters•Apr 14, 2010•445 citations

Fidelity Estimation of Entangled Measurements with Local States

Zanqiu Shen, Kun Wang

We propose an efficient protocol to estimate the fidelity of an $n$-qubit entangled measurement device, requiring only qubit state preparations and classical data post-processing. It works by measuring the eigenstates of Pauli operators, which are strategically selected according to their importance weights and collectively contributed by all measurement operators. We rigorously analyze the protocol's performance and demonstrate that its sample complexity is uniquely determined by the number of Pauli operators possessing non-zero expectation values with respect to the target measurement. Moreover, from a resource-theoretic perspective, we introduce the stabilizer Rényi entropy of quantum measurements as a precise metric to quantify the inherent difficulty of estimating measurement fidelity.

arXiv:2312.13730•Dec 21, 2023•0 citations

Improved Quantum Algorithms for Rényi Entropies Estimation

Zongxing Xiong, Chengshen Gao, Lvzhou Li

Entropy estimation of discrete probability distributions is a fundamental problem in statistical inference and quantum property estimation. In this paper, we study the problem of estimating Rényi entropy $H_α(\mathbf{p})$ for any distribution $\mathbf{p} = (p_i)_{i=1}^n$ given its purified quantum query-access. For non-integer $α> 1$, our algorithm estimates $H_α(\mathbf{p})$ to within additive error $ε$ using only $\widetilde{\mathcal{O}}\big(n^{\max\{1/2,1-1/α\}}/ε\big)$ queries, which improves the best known upper bound for dependence on both $n$ and $1/ε$. For $0<α<1$, our algorithm has query complexity $\widetilde{\mathcal{O}}\big(n^{1/(2α)}/ε^{\max\{1,1/(2α)\}}\big)$, which improves the dependence on $1/ε$ of the current best upper bound without incresing its $n$ dependence. Our approach adapts the multi-level estimation framework to relative approximation of the power sums and leverage binary search to remove the requirement of prior knowledge of them. We also strengthen the precision-dependent lower bound to $Ω\big(1/ε^{\max\{1,1/(2α)\}}\big)$ for $0<α<1$, which identifies the optimal precision dependence of our algorithm.

quant-pharXiv:2610.19936•Oct 15, 2026•0 citations

Generalized Rényi Entropy Accumulation Theorem and Generalized Quantum Probability Estimation

Amir Arqand, Thomas A. Hahn, Ernest Y.-Z. Tan

The entropy accumulation theorem—and its subsequent generalized version—is a powerful tool in the security analysis of many device-dependent and device-independent cryptography protocols. However, it has the drawback that the finite-size bounds it yields are not necessarily optimal; furthermore, it relies on the construction of an affine min-tradeoff function, which can often be challenging to construct optimally in practice. In this work, we address both of these challenges simultaneously by deriving a new entropy accumulation bound. Our bound yields significantly better finite-size performance and can be computed as an intuitively interpretable convex optimization, without any specification of affine min-tradeoff functions. Furthermore, it can be applied directly at the level of Rényi entropies if desired, yielding fully-Rényi security proofs. Our proof techniques are based on elaborating on a connection between entropy accumulation and the frameworks of quantum probability estimation or f -weighted Rényi entropies; in the process, we obtain some new results with respect to those frameworks as well. In particular, those findings imply that our bounds apply to prepare-and-measure protocols without the virtual tomography procedures or repetition-rate restrictions previously required for entropy accumulation.

arXiv:2405.05912•Physical Review X•Jul 18, 2025•30 citations
The second-order Rényi entropy is one of the most important quantities used for characterizing the entanglement structure of states prepared in quantum many-body experiments. With access to qubit projective measurement data, it can be estimated via a protocol in which repeated measurements are taken after each of a set of random local unitary operations is applied to the quantum state. To obtain accurate values for the second Rényi entropy on shot-limited devices, care must be taken when choosing the number of different unitary settings to apply, and the respective number of projective measurements to take. In this paper, we propose an adaptive protocol for estimating the Rényi entropy that iteratively optimizes the ratio of basis settings to measurements, using a gradient-based approach and starting from an initial small set of measurements. Using synthetic data, we demonstrate that for several prototypical states, our method converges to values for this ratio that are comparable to the optimal values obtained by a brute-force grid search, and it exhibits slower growth of the measurement budget required for a fixed target accuracy than fixed-ratio protocols. Our adaptive protocol therefore promotes efficient estimation of the Rényi entropy in finite-size, shot-limited quantum experiments by making effective use of the available measurement budget.
Entanglement is a key feature of many-body quantum systems. Measuring the entropy of different partitions of a quantum system provides a way to probe its entanglement structure. Here, we present and experimentally demonstrate a protocol for measuring the second-order Rényi entropy based on statistical correlations between randomized measurements. Our experiments, carried out with a trapped-ion quantum simulator with partition sizes of up to 10 qubits, prove the overall coherent character of the system dynamics and reveal the growth of entanglement between its parts, in both the absence and presence of disorder. Our protocol represents a universal tool for probing and characterizing engineered quantum systems in the laboratory, which is applicable to arbitrary quantum states of up to several tens of qubits.
In this article, we present quantum algorithms for estimating von Neumann entropy and Renyi entropy, which are crucial physical and information-theoretical properties of a given quantum state $\ensuremath{\rho}$. Although there have been existing works that have achieved the same goal, some prior developments assume the unitary that prepares the purification to the target state $\ensuremath{\rho}$. Here, we consider an alternative setting where only copies of $\ensuremath{\rho}$ are given and we construct a quantum algorithm that estimates the desired entropy. Our framework completes the given task by measuring a small number of ancilla qubits without directly measuring the system, and it achieves significant improvement over prior relevant developments. For example, for the Renyi entropy of the order of nonintegral $\ensuremath{\alpha}$, our method achieves almost a power-of-2 improvement in sample complexity with respect to the rank of the given state and almost a power-of-2 improvement in error tolerance compared with the work by Wang et al. [Y. Wang, B. Zhao, and X. Wang, Phys. Rev. Appl. 19, 044041 (2023)].
We develop a quantum Monte Carlo procedure, in the valence bond basis, to measure the Renyi entanglement entropy of a many-body ground state as the expectation value of a unitary Swap operator acting on two copies of the system. An improved estimator involving the ratio of Swap operators for different subregions enables convergence of the entropy in a simulation time polynomial in the system size. We demonstrate convergence of the Renyi entropy to exact results for a Heisenberg chain. Finally, we calculate the scaling of the Renyi entropy in the two-dimensional Heisenberg model and confirm that the Néel ground state obeys the expected area law for systems up to linear size L=32.
We propose an efficient protocol to estimate the fidelity of an nnn-qubit entangled measurement device, requiring only qubit state preparations and classical data post-processing. It works by measuring the eigenstates of Pauli operators, which are strategically selected according to their importance weights and collectively contributed by all measurement operators. We rigorously analyze the protocol's performance and demonstrate that its sample complexity is uniquely determined by the number of Pauli operators possessing non-zero expectation values with respect to the target measurement. Moreover, from a resource-theoretic perspective, we introduce the stabilizer Rényi entropy of quantum measurements as a precise metric to quantify the inherent difficulty of estimating measurement fidelity.
Entropy estimation of discrete probability distributions is a fundamental problem in statistical inference and quantum property estimation. In this paper, we study the problem of estimating Rényi entropy Hα(p)H_α(\mathbf{p})Hα​(p) for any distribution p=(pi)i=1n\mathbf{p} = (p_i)_{i=1}^np=(pi​)i=1n​ given its purified quantum query-access. For non-integer α>1α> 1α>1, our algorithm estimates Hα(p)H_α(\mathbf{p})Hα​(p) to within additive error εεε using only O~(nmax⁡{1/2,1−1/α}/ε)\widetilde{\mathcal{O}}\big(n^{\max\{1/2,1-1/α\}}/ε\big)O(nmax{1/2,1−1/α}/ε) queries, which improves the best known upper bound for dependence on both nnn and 1/ε1/ε1/ε. For 0<α<10<α<10<α<1, our algorithm has query complexity O~(n1/(2α)/εmax⁡{1,1/(2α)})\widetilde{\mathcal{O}}\big(n^{1/(2α)}/ε^{\max\{1,1/(2α)\}}\big)O(n1/(2α)/εmax{1,1/(2α)}), which improves the dependence on 1/ε1/ε1/ε of the current best upper bound without incresing its nnn dependence. Our approach adapts the multi-level estimation framework to relative approximation of the power sums and leverage binary search to remove the requirement of prior knowledge of them. We also strengthen the precision-dependent lower bound to Ω(1/εmax⁡{1,1/(2α)})Ω\big(1/ε^{\max\{1,1/(2α)\}}\big)Ω(1/εmax{1,1/(2α)}) for 0<α<10<α<10<α<1, which identifies the optimal precision dependence of our algorithm.
The entropy accumulation theorem—and its subsequent generalized version—is a powerful tool in the security analysis of many device-dependent and device-independent cryptography protocols. However, it has the drawback that the finite-size bounds it yields are not necessarily optimal; furthermore, it relies on the construction of an affine min-tradeoff function, which can often be challenging to construct optimally in practice. In this work, we address both of these challenges simultaneously by deriving a new entropy accumulation bound. Our bound yields significantly better finite-size performance and can be computed as an intuitively interpretable convex optimization, without any specification of affine min-tradeoff functions. Furthermore, it can be applied directly at the level of Rényi entropies if desired, yielding fully-Rényi security proofs. Our proof techniques are based on elaborating on a connection between entropy accumulation and the frameworks of quantum probability estimation or f -weighted Rényi entropies; in the process, we obtain some new results with respect to those frameworks as well. In particular, those findings imply that our bounds apply to prepare-and-measure protocols without the virtual tomography procedures or repetition-rate restrictions previously required for entropy accumulation.