analiza aiqbench
This research establishes fundamental structural lower bounds for quantum property estimation, demonstrating that modest persistent memory registers cannot overcome sample complexity barriers due to rank constraints on observable overlap. By utilizing a backward-induction framework with operator resolvents, the authors derive optimal linear trade-offs between system dimension and error scaling, eliminating previous cubic losses in theoretical bounds. These findings clarify the precise limits of adaptive quantum strategies when limited coherent resources are available.
Structural Lower Bounds for Quantum Property Estimation with Persistent Memory
arXiv:2611.05792v1 Announce Type: new Abstract: In quantum property estimation, an experimenter estimates $\operatorname{Tr}(O\rho)$ for a family of observables from independent copies of an unknown state $\rho$ simultaneously to additive error $\epsilon$. While quantum memory can dramatically reduce sample complexity, understanding the power of a modest register that remains coherent throughout an adaptive experiment has remained an open challenge because existing frameworks require optimizing over the infinite space of measurement trees. We overcome this barrier by developing a backward-induction framework based on operator resolvents. Rather than tracking path-dependent memory states across rounds, resolvent regularization cancels internal memory trajectories exactly, reducing the lower bound to an algebraic certificate computed directly from the target observables with sharp $\Omega(1/\epsilon^2)$ scaling. Our structural rule charges only the retained dimension $K$ under arbitrary adaptive instruments and unrestricted memory lifetime. Via symmetry reductions, it yields polynomial-size linear programs that establish the optimal linear $\Omega(D/(K\epsilon^2))$ trade-off for the $D^2-1$ Paulis, eliminating the cubic loss in prior bounds. For growing weight-$w$ Pauli strings ($w=\lceil\log_2 n\rceil$) and quadratic Majorana cross-correlations, it proves lower bounds of $\Omega(3^w/\epsilon^2)$ and $\Omega(n^2/(\epsilon^2(1+\ln n)^2))$ against an indefinitely persistent memory of dimension $K=\lfloor\sqrt n\rfloor$. These bounds match memoryless or commuting estimators within polylogarithmic factors, demonstrating that rank constraints on the persistent register fundamentally throttle observable overlap and prevent a modest coherent memory from overcoming the sample complexity barrier.
Abstract:In quantum property estimation, an experimenter estimates $\operatorname{Tr}(O\rho)$ for a family of observables from independent copies of an unknown state $\rho$ simultaneously to additive error $\epsilon$. While quantum memory can dramatically reduce sample complexity, understanding the power of a modest register that remains coherent throughout an adaptive experiment has remained an open challenge because existing frameworks require optimizing over the infinite space of measurement trees. We overcome this barrier by developing a backward-induction framework based on operator resolvents. Rather than tracking path-dependent memory states across rounds, resolvent regularization cancels internal memory trajectories exactly, reducing the lower bound to an algebraic certificate computed directly from the target observables with sharp $\Omega(1/\epsilon^2)$ scaling. Our structural rule charges only the retained dimension $K$ under arbitrary adaptive instruments and unrestricted memory lifetime. Via symmetry reductions, it yields polynomial-size linear programs that establish the optimal linear $\Omega(D/(K\epsilon^2))$ trade-off for the $D^2-1$ Paulis, eliminating the cubic loss in prior bounds. For growing weight-$w$ Pauli strings ($w=\lceil\log_2 n\rceil$) and quadratic Majorana cross-correlations, it proves lower bounds of $\Omega(3^w/\epsilon^2)$ and $\Omega(n^2/(\epsilon^2(1+\ln n)^2))$ against an indefinitely persistent memory of dimension $K=\lfloor\sqrt n\rfloor$. These bounds match memoryless or commuting estimators within polylogarithmic factors, demonstrating that rank constraints on the persistent register fundamentally throttle observable overlap and prevent a modest coherent memory from overcoming the sample complexity barrier.
arXiv:2611.05792 [quant-ph]
(or arXiv:2611.05792v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2611.05792 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 308 cuvinte
Subiecte conexe
Learning the Structure of Triangular Transport Maps
arXiv · 30 sept. 2026
Edge Accuracy Is Not Enough: Why Dynamics-Learned Structure Fails to Transfer to Inverse Problems
arXiv · 8 oct. 2026
Low-Rank Plus Sparse Matrix Transfer Learning under Growing Representations and Ambient Dimensions
arXiv · 9 sept. 2026
Structural Inference under Hidden Agents
arXiv · 17 sept. 2026