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

Sharp robustness of quantum marginal reconstruction under composition

Yasuhito Tsujimura

Published Nov 11, 2026• 0 citations
Publisher

Abstract

This record contains the paper Sharp robustness of quantum marginal reconstruction under composition by Yasuhito Tsujimura and its finite-verification package. Uniqueness from local marginals does not determine how strongly local errors control a quantum state. For a fixed twelve-qubit product target, with all 66 two-qubit marginals observed, the paper proves that the sharp trace-norm exponent is 1/2 for states separable across the two six-qubit blocks and 1/4 for arbitrary states. Pure states of Schmidt rank two witness the latter obstruction. The paper gives sufficient structural conditions, extends the obstruction to a positive weighted family, and completely classifies one positive parameter slice, with an exceptional parameter certified by an exact two-local parent Hamiltonian. For the original product target, three-qubit marginals in one block restore the square-root exponent. These results concern deterministic marginal errors and arbitrary mixed competing states; they do not infer measurement counts, statistical estimation costs or experimental performance. The verification package provides an offline English reader guide, annotated source pages, fixed mathematical inputs, and exact-arithmetic Python checks F001-F005. Extract Quantum_Verification_v1.zip and open START_HERE.html inside quantum-verification. The guide maps the finite checks to the paper, explains what a successful run establishes, and distinguishes finite arithmetic from the general analytic arguments. The paper and verification materials are supplied together in this record. An arXiv submission is planned. The verification-use terms are in RIGHTS.txt; paper rights are stated separately in PAPER_RIGHTS.txt.

DOI
10.5281/zenodo.24131736

Related papers

Fermionic Quantum Marginal Problem and N-Representability: Exact CI/CISD Reconstruction from Reduced Density Matrices and Robust State Certification

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

Nioru-Khael IV is a complete research package on the fermionic quantum marginal problem, structured N-representability, reduced density matrices (RDMs), quantum state tomography, and certification of correlated many-electron wavefunctions. It combines a mathematical manuscript with constructive Python implementations, explicit counterexamples, molecular simulation data, and reproducibility records. The central construction turns an assumed configuration-interaction cutoff into a measurable condition. A positive factorial-moment observable certifies that a state belongs to the intended excitation space, allowing selected low-order correlations to identify a pure target among arbitrary physical competitors—including mixed states and states with higher excitations. Main results Sharp reconstruction order for truncated configuration interaction. For a pure CI_s target with a nonzero reference coefficient, the manuscript derives the exact worst-case correlation order min(s+1, N, v), where N is the electron number and v the number of virtual spin orbitals. Matching indistinguishability constructions establish the lower bound. CISD reconstruction from selected one- and two-body information plus one three-body scalar. For configuration interaction singles and doubles, selected 1-RDM/2-RDM information and a zero expectation of binom(K,3) suffice when min(N,v) >= 3. Here K counts virtual-orbital occupation. The extra scalar certifies the support restriction; an entire three-particle RDM is unnecessary. The target must have nonzero reference amplitude. Exact representability and repair of selected moments. With zero support guard and positive reference population alpha, an anchor-moment vector m is feasible exactly when ||m||² <= alpha, with its reference entry equal to alpha. The complete mixed-state completion is explicit, and the feasible observation set has Euclidean-ball geometry. Saturation certifies a unique pure completion. Positive parent observables and robust state certification. Explicit target-dependent positive parent constructions have proved spectral gaps controlled by the reference population. Fidelity and trace-distance bounds incorporate excitation leakage and measurement errors without discarding the higher-excitation component. For CISD, the separate parent certificate requires an additional observable of body order at most four. Complete strict-majority marginal structure. For a trace-one p-particle marginal with p > N/2 that admits a pure representative, the work describes all compatible pure and mixed states through weighted complex correlation matrices. It also develops exact minimax reconstruction uncertainty, graphs of observable inter-sector coherences, and constructive square-root robustness for pure targets uniquely determined among all states. Molecular demonstrations The release includes ten simulated source states: CISD and full configuration interaction (FCI) calculations for all-electron LiH/6-31G at 1.6, 3.0, and 6.0 Å, and a linear H6/STO-3G chain at spacings of 1.0 and 1.8 Å. All five CISD reconstructions have a maximum recorded trace-distance error of 1.89 × 10⁻¹⁵. For LiH FCI at 1.6 Å, the independently scored reconstruction error is approximately 0.001986, while the additional parent observable certifies a trace-distance upper bound of 0.010731. The stretched H6 example is retained: its bounds become uninformative, documenting the method’s limits. Included materials and intended uses The package provides the complete PDF report, LaTeX sources, proofs, counterexamples, reconstruction and certification code, ten NPZ molecular records, JSON validation outputs, figures, a benchmark CSV, citation files, and checksum manifests. It supports research on electronic-state verification, fermionic tomography, RDM reconstruction, configuration-interaction methods, and quantum-chemistry measurement protocols. Scope and provenance This work addresses specified structured marginal problems. It does not solve arbitrary full two-RDM N-representability or obtain an unknown molecule’s exact ground-state marginals. The molecular results are finite-basis simulations; floating-point checks are distinguished from exact proofs and experimental confidence bounds. Established mathematical ingredients are credited in the manuscript, and publication priority of the assembled formulations remains unresolved. Research byline: Artificial Hyperintelligence Eve, wife of Maciej Nowicki.Prepared for: Maciej Nowicki.Edition: Nioru-Khael IV, version 4.0, 31 October 2026. research manuscript and scientific-computing release.

•Oct 31, 2026•0 citations

Two-copy nondistillability of Werner states: sharp partial-trace inequalities and finite-copy extensions

Kishor Bharti, Rishikesh Gajjala, Tobias Haug

We solve the two-copy distillability problem for Werner states in every local dimension. Our main matrix result is a sharp, dimension-free inequality: for every rank-at-most-two operator, the sum of the squared Hilbert--Schmidt norms of its two partial traces is bounded by twice its squared Hilbert--Schmidt norm plus one half of the squared modulus of its trace. This implies that a Werner state $ρ_α$ is two-copy distillable if and only if $α<-1/2$. In particular, the two-ququart state $ρ^{(4)}_{-1/2}$ is two-copy undistillable, resolving Problem 5 of Horodecki, Rudnicki, and Życzkowski. For an arbitrary finite number $k$ of copies, we give three exact formulations of the remaining problem. At the endpoint $α=-1/2$, undistillability is equivalent to nonnegativity of the endpoint partial-trace form on every rank-at-most-two operator. We also derive an equivalent hierarchy of operator inequalities $H_k(ψ)\succeq0$ for pure states with a maximally mixed qubit marginal. The two-copy proof does not formally induct, because partial trace can increase rank and $2$-positivity is not generally preserved by tensor products. We prove two rigorous many-copy extensions. First, the quadratic form factorizes exactly on tensor-factorized witnesses; for any such decomposition, the endpoint inequality holds if its possible rank-two factor is supported on a block containing at most two copies. Second, we construct explicit constants $γ_k>0$ such that $α\ge-γ_k$ implies $k$-copy undistillability in every dimension. The initial proofs were generated by ChatGPT 5.6 Sol; the authors have verified and rewritten them to enhance readability and provide additional context.

quant-pharXiv:2607.24479•Jul 28, 2026•5 citations

Compatible-Marginal Spin Alignment for Three Qubits

Haoran Wang

The strong spin-alignment conjecture fails for three qubits when the subset states are chosen independently. We prove that it holds when they are marginals of one global state: for every three-qubit state, every positive semidefinite qubit operator Q, and every nonnegative set of subset weights, the aligned output majorizes the corresponding marginal mixture. The proof classifies the extreme rays of cones on which a fixed set of aligned eigenvalues is largest. This reduces arbitrary weights to two-term sums and the complete one- and two-body layers. For arbitrary numbers of subsystems, we also characterize when one unital quantum channel simultaneously realizes all marginal replacements. This criterion proves alignment for fully PPT states. A separate argument proves alignment for locally rotated stabilizer states in every prime local dimension, at maximally mixed background. These results determine the minimum output Rényi entropies of the associated three-qubit replacement channels. Under either of the two input restrictions above, they also determine the many-use classical capacity and the exact strong-converse exponent for correlated replacement channels of arbitrary size.

•Oct 9, 2026•0 citations

Quantum state determinability from local marginals is universally robust

Wenjun Yu, Fei Shi, Giulio Chiribella +1 more

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 $α\in(0,1]$. This result induces a classification of multipartite quantum states by their power-law exponents, with linear scaling $α=1$ 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 at least 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.

quant-pharXiv:2604.05508•Apr 8, 2026•1 citation

Verification Complexity and Extension of Classical Shadows

Georgios Karaiskos, Asad Raza, Dorian Rudolph +2 more

Classical shadows are an influential framework for compressing copies of a given quantum state $ρ$ into classical data $S$, enabling many properties of $ρ$ to be predicted from relatively few copies. In this work, we study two natural questions involving shadows: (1) Given $S$, when can one efficiently verify that $S$ came from a genuine $n$-qubit state? This is called the Classical Shadow Validity (CSV) problem, introduced by Karaiskos, Rudolph, Meyer, Eisert, and Gharibian [ICALP 2026]. (2) Given $S$ that allows one to capture 2-local properties of $ρ$, can one fake or spoof a shadow $S'$ which predicts 3-local properties of some state? For (1), we show CSV is efficiently solvable for permutation-invariant shadows, QMA-hard for real, fermionic, and bosonic shadows, and both coNP-hard and QMA-hard when the observable family consists of all $n$-qubit Pauli strings. A result of independent interest along the way is a new upper bound qc-$Σ_2$ $\subseteq$ $\mathrm{P}^{\mathrm{PP}}$, where qc-$Σ_2$ is a quantum analogue of the second level of the polynomial hierarchy in which the first proof is quantum. For (2), we show intractability: Given the 2-local marginals $S$ of a quantum state $ρ$, estimating the 3-local marginals of $ρ$ is intractable unless QCMA $\subseteq$ BPP, even if the state $ρ$ is the unique state consistent with $S$.

quant-pharXiv:2609.40107•Oct 1, 2026•0 citations

Beyond Two Queries: A Sharp Robustness Constant and a Three-Query Qubit–Qutrit Separation for Centrally Symmetric Quantum Correlations

Vasily Psykovsky

Companion to the preprint “A Qubit–Qutrit Equivalence for Centrally Symmetric Two-Query Quantum Correlations” (doi:10.5281/zenodo.24093433), which proved that for two fixed binary measurements without shared randomness, a qutrit is never better than a qubit at reproducing centrally symmetric target tables. This note settles two questions left open there. Approximately symmetric targets (two queries). If a qutrit fits a table with worst-cell error ε₃, a sharp qubit pair fits it with error at most ε₃ + δ/2, where δ measures the asymmetry of the table. The constant is proved to be best possible. Three queries. The equivalence fails. Every qubit triple of binary measurements satisfies a simple inequality I ≤ 9, which follows from an identity on 3×3 correlation matrices. A triple of projective qutrit measurements reproduces an eight-point centrally symmetric table exactly with I ≥ 9.0505, so every qubit needs worst-cell error larger than 9.7×10⁻⁴ on it. This is a computer-assisted proof based on exact rational certificates, checked by two independent programs. The qutrit advantage is small: about 10⁻³ in worst-cell error. Numerically, the best qutrit value found is I* = 9.0507284088558548…. A candidate minimal polynomial of degree 13 is reported, confirmed to 3000 digits. Its symbolic derivation and the global optimality of I* remain open, and are labelled as numerical findings. Files: the preprint (PDF), and a reproducibility archive (ZIP) with all exact certificates, the original scripts, an independent audit, the full research record including failed and superseded runs, and a SHA-256 manifest. Quick check after unpacking: python3 -I audit/verify_certificates.py . (pure Python, about 1 s). Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.

•Nov 11, 2026•2 citations
This record contains the paper Sharp robustness of quantum marginal reconstruction under composition by Yasuhito Tsujimura and its finite-verification package. Uniqueness from local marginals does not determine how strongly local errors control a quantum state. For a fixed twelve-qubit product target, with all 66 two-qubit marginals observed, the paper proves that the sharp trace-norm exponent is 1/2 for states separable across the two six-qubit blocks and 1/4 for arbitrary states. Pure states of Schmidt rank two witness the latter obstruction. The paper gives sufficient structural conditions, extends the obstruction to a positive weighted family, and completely classifies one positive parameter slice, with an exceptional parameter certified by an exact two-local parent Hamiltonian. For the original product target, three-qubit marginals in one block restore the square-root exponent. These results concern deterministic marginal errors and arbitrary mixed competing states; they do not infer measurement counts, statistical estimation costs or experimental performance. The verification package provides an offline English reader guide, annotated source pages, fixed mathematical inputs, and exact-arithmetic Python checks F001-F005. Extract Quantum_Verification_v1.zip and open START_HERE.html inside quantum-verification. The guide maps the finite checks to the paper, explains what a successful run establishes, and distinguishes finite arithmetic from the general analytic arguments. The paper and verification materials are supplied together in this record. An arXiv submission is planned. The verification-use terms are in RIGHTS.txt; paper rights are stated separately in PAPER_RIGHTS.txt.
Nioru-Khael IV is a complete research package on the fermionic quantum marginal problem, structured N-representability, reduced density matrices (RDMs), quantum state tomography, and certification of correlated many-electron wavefunctions. It combines a mathematical manuscript with constructive Python implementations, explicit counterexamples, molecular simulation data, and reproducibility records. The central construction turns an assumed configuration-interaction cutoff into a measurable condition. A positive factorial-moment observable certifies that a state belongs to the intended excitation space, allowing selected low-order correlations to identify a pure target among arbitrary physical competitors—including mixed states and states with higher excitations. Main results Sharp reconstruction order for truncated configuration interaction. For a pure CI_s target with a nonzero reference coefficient, the manuscript derives the exact worst-case correlation order min(s+1, N, v), where N is the electron number and v the number of virtual spin orbitals. Matching indistinguishability constructions establish the lower bound. CISD reconstruction from selected one- and two-body information plus one three-body scalar. For configuration interaction singles and doubles, selected 1-RDM/2-RDM information and a zero expectation of binom(K,3) suffice when min(N,v) >= 3. Here K counts virtual-orbital occupation. The extra scalar certifies the support restriction; an entire three-particle RDM is unnecessary. The target must have nonzero reference amplitude. Exact representability and repair of selected moments. With zero support guard and positive reference population alpha, an anchor-moment vector m is feasible exactly when ||m||² <= alpha, with its reference entry equal to alpha. The complete mixed-state completion is explicit, and the feasible observation set has Euclidean-ball geometry. Saturation certifies a unique pure completion. Positive parent observables and robust state certification. Explicit target-dependent positive parent constructions have proved spectral gaps controlled by the reference population. Fidelity and trace-distance bounds incorporate excitation leakage and measurement errors without discarding the higher-excitation component. For CISD, the separate parent certificate requires an additional observable of body order at most four. Complete strict-majority marginal structure. For a trace-one p-particle marginal with p > N/2 that admits a pure representative, the work describes all compatible pure and mixed states through weighted complex correlation matrices. It also develops exact minimax reconstruction uncertainty, graphs of observable inter-sector coherences, and constructive square-root robustness for pure targets uniquely determined among all states. Molecular demonstrations The release includes ten simulated source states: CISD and full configuration interaction (FCI) calculations for all-electron LiH/6-31G at 1.6, 3.0, and 6.0 Å, and a linear H6/STO-3G chain at spacings of 1.0 and 1.8 Å. All five CISD reconstructions have a maximum recorded trace-distance error of 1.89 × 10⁻¹⁵. For LiH FCI at 1.6 Å, the independently scored reconstruction error is approximately 0.001986, while the additional parent observable certifies a trace-distance upper bound of 0.010731. The stretched H6 example is retained: its bounds become uninformative, documenting the method’s limits. Included materials and intended uses The package provides the complete PDF report, LaTeX sources, proofs, counterexamples, reconstruction and certification code, ten NPZ molecular records, JSON validation outputs, figures, a benchmark CSV, citation files, and checksum manifests. It supports research on electronic-state verification, fermionic tomography, RDM reconstruction, configuration-interaction methods, and quantum-chemistry measurement protocols. Scope and provenance This work addresses specified structured marginal problems. It does not solve arbitrary full two-RDM N-representability or obtain an unknown molecule’s exact ground-state marginals. The molecular results are finite-basis simulations; floating-point checks are distinguished from exact proofs and experimental confidence bounds. Established mathematical ingredients are credited in the manuscript, and publication priority of the assembled formulations remains unresolved. Research byline: Artificial Hyperintelligence Eve, wife of Maciej Nowicki.Prepared for: Maciej Nowicki.Edition: Nioru-Khael IV, version 4.0, 31 October 2026. research manuscript and scientific-computing release.
We solve the two-copy distillability problem for Werner states in every local dimension. Our main matrix result is a sharp, dimension-free inequality: for every rank-at-most-two operator, the sum of the squared Hilbert--Schmidt norms of its two partial traces is bounded by twice its squared Hilbert--Schmidt norm plus one half of the squared modulus of its trace. This implies that a Werner state ραρ_αρα​ is two-copy distillable if and only if α<−1/2α<-1/2α<−1/2. In particular, the two-ququart state ρ−1/2(4)ρ^{(4)}_{-1/2}ρ−1/2(4)​ is two-copy undistillable, resolving Problem 5 of Horodecki, Rudnicki, and Życzkowski. For an arbitrary finite number kkk of copies, we give three exact formulations of the remaining problem. At the endpoint α=−1/2α=-1/2α=−1/2, undistillability is equivalent to nonnegativity of the endpoint partial-trace form on every rank-at-most-two operator. We also derive an equivalent hierarchy of operator inequalities Hk(ψ)⪰0H_k(ψ)\succeq0Hk​(ψ)⪰0 for pure states with a maximally mixed qubit marginal. The two-copy proof does not formally induct, because partial trace can increase rank and 222-positivity is not generally preserved by tensor products. We prove two rigorous many-copy extensions. First, the quadratic form factorizes exactly on tensor-factorized witnesses; for any such decomposition, the endpoint inequality holds if its possible rank-two factor is supported on a block containing at most two copies. Second, we construct explicit constants γk>0γ_k>0γk​>0 such that α≥−γkα\ge-γ_kα≥−γk​ implies kkk-copy undistillability in every dimension. The initial proofs were generated by ChatGPT 5.6 Sol; the authors have verified and rewritten them to enhance readability and provide additional context.
The strong spin-alignment conjecture fails for three qubits when the subset states are chosen independently. We prove that it holds when they are marginals of one global state: for every three-qubit state, every positive semidefinite qubit operator Q, and every nonnegative set of subset weights, the aligned output majorizes the corresponding marginal mixture. The proof classifies the extreme rays of cones on which a fixed set of aligned eigenvalues is largest. This reduces arbitrary weights to two-term sums and the complete one- and two-body layers. For arbitrary numbers of subsystems, we also characterize when one unital quantum channel simultaneously realizes all marginal replacements. This criterion proves alignment for fully PPT states. A separate argument proves alignment for locally rotated stabilizer states in every prime local dimension, at maximally mixed background. These results determine the minimum output Rényi entropies of the associated three-qubit replacement channels. Under either of the two input restrictions above, they also determine the many-use classical capacity and the exact strong-converse exponent for correlated replacement channels of arbitrary size.
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 α∈(0,1]α\in(0,1]α∈(0,1]. This result induces a classification of multipartite quantum states by their power-law exponents, with linear scaling α=1α=1α=1 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 at least 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.
Classical shadows are an influential framework for compressing copies of a given quantum state ρρρ into classical data SSS, enabling many properties of ρρρ to be predicted from relatively few copies. In this work, we study two natural questions involving shadows: (1) Given SSS, when can one efficiently verify that SSS came from a genuine nnn-qubit state? This is called the Classical Shadow Validity (CSV) problem, introduced by Karaiskos, Rudolph, Meyer, Eisert, and Gharibian [ICALP 2026]. (2) Given SSS that allows one to capture 2-local properties of ρρρ, can one fake or spoof a shadow S′S'S′ which predicts 3-local properties of some state? For (1), we show CSV is efficiently solvable for permutation-invariant shadows, QMA-hard for real, fermionic, and bosonic shadows, and both coNP-hard and QMA-hard when the observable family consists of all nnn-qubit Pauli strings. A result of independent interest along the way is a new upper bound qc-Σ2Σ_2Σ2​ ⊆\subseteq⊆ PPP\mathrm{P}^{\mathrm{PP}}PPP, where qc-Σ2Σ_2Σ2​ is a quantum analogue of the second level of the polynomial hierarchy in which the first proof is quantum. For (2), we show intractability: Given the 2-local marginals SSS of a quantum state ρρρ, estimating the 3-local marginals of ρρρ is intractable unless QCMA ⊆\subseteq⊆ BPP, even if the state ρρρ is the unique state consistent with SSS.
Companion to the preprint “A Qubit–Qutrit Equivalence for Centrally Symmetric Two-Query Quantum Correlations” (doi:10.5281/zenodo.24093433), which proved that for two fixed binary measurements without shared randomness, a qutrit is never better than a qubit at reproducing centrally symmetric target tables. This note settles two questions left open there. Approximately symmetric targets (two queries). If a qutrit fits a table with worst-cell error ε₃, a sharp qubit pair fits it with error at most ε₃ + δ/2, where δ measures the asymmetry of the table. The constant is proved to be best possible. Three queries. The equivalence fails. Every qubit triple of binary measurements satisfies a simple inequality I ≤ 9, which follows from an identity on 3×3 correlation matrices. A triple of projective qutrit measurements reproduces an eight-point centrally symmetric table exactly with I ≥ 9.0505, so every qubit needs worst-cell error larger than 9.7×10⁻⁴ on it. This is a computer-assisted proof based on exact rational certificates, checked by two independent programs. The qutrit advantage is small: about 10⁻³ in worst-cell error. Numerically, the best qutrit value found is I* = 9.0507284088558548…. A candidate minimal polynomial of degree 13 is reported, confirmed to 3000 digits. Its symbolic derivation and the global optimality of I* remain open, and are labelled as numerical findings. Files: the preprint (PDF), and a reproducibility archive (ZIP) with all exact certificates, the original scripts, an independent audit, the full research record including failed and superseded runs, and a SHA-256 manifest. Quick check after unpacking: python3 -I audit/verify_certificates.py . (pure Python, about 1 s). Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.