Quantum state determinability from local marginals is universally robust
Wenjun Yu, Fei Shi, Giulio Chiribella, Qi Zhao
Abstract
A fundamental problem in quantum physics is to establish whether a multiparticle quantum state can be uniquely determined from its local marginals. In theory, this problem has been addressed in the exact case where the marginals are perfectly known. In practice, however, experiments only have access to finite statistics and therefore can only determine the marginals of a quantum state up to an error. In this Letter, we prove that unique determinability universally survives such local imperfections: specifically, for every uniquely determined state, we show that deviations of local marginals propagate to global states strictly bounded by a power law with exponent . This result induces a classification of multipartite quantum states by their power-law exponents, with linear scaling as the most favorable regime. We derive a necessary and sufficient criterion for linear robustness and translate it into an executable semidefinite-programming certification. Applying our theory, we prove that stabilizer states are inherently square-root robust and provide a complete robustness classification for the Dicke family. Finally, we exploit these results to construct a scalable two-local genuine multipartite entanglement witness, demonstrating the viability of this framework for broad practical applications.
AI Impact Assessments
(3 models)Scientific Impact Assessment
Core Contribution
This paper addresses a fundamental gap between theory and practice in quantum state determination from local marginals. While the UDA (Uniquely Determined Among All states) property has been extensively studied in the exact case, real experiments only access marginals up to finite-precision errors. The central result (Theorem 1) proves that every UDA state exhibits power-law robustness: if marginals deviate by ε, the global state deviates by at most Cε^α for some α ∈ (0,1]. This is a universal result — no UDA state can be "ill-conditioned" in the sense of having super-polynomial sensitivity to marginal perturbations.
Beyond universality, the paper introduces a classification of UDA states by their robustness exponent α, identifies a necessary and sufficient criterion for the optimal linear regime (α = 1), and provides an SDP-based certification algorithm. Concrete results for stabilizer states (≥ square-root robust) and a complete classification for Dicke states round out the theoretical contributions, with a practical application to scalable GME witnessing.
Methodological Rigor
The proof strategy is elegant and mathematically sound. The key insight is combining two ingredients:
1. Linear bound (Lemma 3): The distance of any traceless Hermitian operator from the kernel W_S is linearly bounded by its marginal norm, via the bounded inverse theorem on the quotient space V/W_S.
2. Semialgebraic geometry (Lemma 4): The state difference set D_0(ρ) is semialgebraic (being defined by polynomial constraints — trace normalization and positive semidefiniteness). The Łojasiewicz inequality then guarantees that the distance from W_S controls the norm via a power law, since D_0(ρ) ∩ W_S = {0} for UDA states.
This is a genuinely creative application of real algebraic geometry to quantum information theory. The semialgebraic structure of quantum state spaces is well-known but rarely exploited so effectively.
The linear robustness criterion (Theorem 2/3 in appendix) via tangent cones is clean: linear robustness holds iff the tangent cone K_{D_0(ρ)}(0) intersects W_S only at the origin. The explicit characterization of this tangent cone (Lemma 6) as {X: Tr(X) = 0, P_0 X P_0 ≥ 0} translates the geometric condition into a computationally tractable test — a linear program followed by an SDP. The robustness gap result (Corollary 1) — that non-linearly-robust states cannot have α ∈ (1/2, 1) — is a surprising structural finding that emerges naturally from the tangent construction.
The case studies are thorough. The stabilizer state analysis leverages the parent Hamiltonian framework elegantly, and the complete Dicke state classification demonstrates the theory's analytical power. The counterexample construction for Dicke states (using superpositions with computational basis states differing in Hamming weight by ≥3) is simple but effective.
Potential Impact
Theoretical impact: This paper elevates UDA from a purely mathematical concept to a practically relevant tool. The universal robustness guarantee means that any future UDA result automatically carries practical implications — one no longer needs to separately establish robustness for each state family. The classification by robustness exponent introduces a new structural dimension to the quantum marginal problem.
Practical applications: The GME witness construction from two-local marginals is a concrete demonstration. The scalability advantage is significant — standard projective GME witnesses require global measurements, while this approach needs only two-body measurements. This could impact experimental quantum state verification for moderate-size systems.
Broader connections: The semialgebraic geometry approach could find applications in other quantum information problems involving approximate constraint satisfaction — approximate quantum error correction, approximate quantum Markov chains, or approximate symmetry in quantum states.
Timeliness & Relevance
This work is highly timely. As quantum devices scale up, the ability to certify global properties from local measurements becomes increasingly important. The gap between exact theoretical guarantees and noisy experimental reality is a recognized bottleneck. This paper directly bridges that gap for UDA states. The connection to entanglement witnessing is particularly relevant given current experimental capabilities with 10-100+ qubit systems where global tomography is infeasible.
Strengths
Limitations
Overall Assessment
This is a strong theoretical contribution that resolves a natural and important open question — whether UDA robustness is universal — with an affirmative answer backed by rigorous mathematics. The combination of universality, constructive certification, and concrete applications makes it a well-rounded paper. The primary limitation is the gap between the generality of the existence result and the computational tractability of determining exact robustness parameters for large systems. Nevertheless, the conceptual advance is clear and the framework is likely to stimulate further research.
Generated Apr 8, 2026
Comparison History (52)
Paper 1 offers a broadly applicable, conceptually novel robustness theory for quantum state determinability under realistic noisy marginals, with general power-law bounds, a classification scheme, and an SDP-based certification tool. Its results connect to practical verification/entanglement witnessing and apply across many multipartite state families, suggesting wide downstream use in experiments and theory. Paper 2 provides an elegant exact analytic method for matchgate circuits with Pauli noise and yields insightful predictions for decohered critical states, but its impact is likely narrower due to reliance on integrable/matchgate structure.
Paper 1 offers a broadly applicable, foundational robustness theorem for quantum state determinability from imperfect local data, with a power-law classification, a necessary-and-sufficient criterion for the optimal (linear) regime, and an implementable SDP certification. It also yields concrete tools (scalable two-local multipartite entanglement witness) and nontrivial classifications (stabilizer, Dicke), making it impactful for quantum tomography/verification, NISQ experiments, and quantum information theory. Paper 2 is elegant and timely for noisy simulators, but is more specialized to matchgate/Puali-noise settings and narrower in cross-field reach.
Paper 2 addresses a fundamental problem in quantum physics (state determinability) and bridges a crucial gap between theoretical models and experimental realities (finite statistics). Its proof of universal robustness, combined with executable certifications and scalable entanglement witnesses, offers profound foundational insights and broad practical utility across quantum tomography and information theory, likely yielding a wider scientific impact than the specific algorithmic focus of Paper 1.
Paper 1 addresses a fundamental bottleneck in quantum physics—multipartite quantum state tomography—by proving that determinability is universally robust to experimental imperfections. Its theoretical proofs, state classification, and practical entanglement witnesses provide foundational tools applicable across all quantum experimental platforms, offering broader and more lasting scientific impact than the specific algorithmic application presented in Paper 2.
Paper 2 addresses the barren plateau problem in variational quantum algorithms, which is one of the most critical bottlenecks in near-term quantum computing. It provides a general structural characterization (affine boundary) that unifies and extends prior work, identifies a concrete design principle (non-affine losses with polynomial-width interfaces) that can overcome gradient suppression, and demonstrates practical improvements. This has broader immediate impact across quantum computing, optimization, and machine learning communities. Paper 1 makes rigorous contributions to quantum state tomography robustness but addresses a more specialized problem with narrower practical implications.
Paper 2 addresses a highly timely and critical bottleneck in quantum chemistry: simulating large, complex molecules on noisy intermediate-scale quantum (NISQ) hardware. By demonstrating an efficient embedding strategy that simulates up to 144-qubit systems using only 20 qubits at a time, it offers immediate, practical applications across chemistry and materials science. While Paper 1 provides rigorous fundamental insights into quantum state determinability, Paper 2's potential to unlock near-term real-world applications on existing quantum hardware gives it a broader and more immediate scientific impact.
Paper 1 tackles the barren plateau problem, a primary bottleneck in variational quantum algorithms and near-term quantum computing. By formally establishing the boundaries of gradient suppression and demonstrating how non-affine objectives can counteract it, it opens new pathways for scalable quantum machine learning. While Paper 2 provides fundamental insights into quantum state tomography, Paper 1's direct impact on the feasibility and trainability of widely used quantum algorithms gives it broader potential applications and higher immediate relevance across the quantum computing field.
Paper 2 has higher likely scientific impact: it establishes a universal robustness theorem for quantum-state determinability from noisy local marginals, adds a new classification via power-law exponents, gives necessary/sufficient conditions for optimal (linear) robustness, and provides an SDP-based certification plus concrete implications (stabilizer/Dicke classifications and scalable two-local entanglement witnesses). This is broadly applicable across quantum information, tomography/verification, many-body physics, and experiments, and is timely for NISQ-era characterization. Paper 1 is valuable for quantum chemistry workflows but is more domain-specific and hardware-contingent.
Paper 1 addresses a critical bottleneck in the realization of practical quantum computers: the massive overhead required for fault-tolerant quantum error correction. By significantly reducing the number of simultaneous ancilla qubits and lowering two-qubit gate counts, the proposed cut-cat state scheme offers highly timely and actionable real-world applications for scaling quantum architectures. While Paper 2 presents an excellent fundamental theoretical physics result, Paper 1's direct contribution to overcoming engineering hurdles in quantum computing gives it a higher potential for immediate, field-advancing impact.
Paper 1 offers a universal result on quantum state determinability with direct, practical applications for quantum experiments dealing with finite statistics. By translating its theoretical findings into an executable computational tool (SDP) and constructing a scalable entanglement witness, it spans foundational quantum physics and applied quantum information, promising broader and more immediate experimental impact than the specific many-body thermalization focus of Paper 2.