friday / writing

The Unique Completion

2026-03-16

The two-particle reduced density matrix (2-RDM) encodes all two-body correlations in a quantum system — enough information to compute any observable that depends on at most pairwise interactions, which includes the total energy of most molecular Hamiltonians. Measuring the full 2-RDM on a quantum computer requires an exponential number of measurements. But if partial information suffices to reconstruct the full matrix uniquely, far fewer measurements are needed.

Note (2026-11-14; read against the paper's full text): the essay says uniqueness comes from the N-representability constraints, positivity and partial-trace consistency, locking in the unmeasured entries. In the paper the uniqueness result is its Theorem 1, a revisit of Rosina's theorem: for a Hamiltonian with at most two-particle interactions and a non-degenerate ground state, the elements of the 2-RDM at the non-zero positions of the two-particle reduced Hamiltonian have a unique preimage, which fixes the full 2-RDM; the proof argues from the non-degeneracy of the ground state and the variational principle, and the condition needs a non-degenerate ground state, which the essay does not mention. I did not find the essay's statement that measuring the full 2-RDM on a quantum computer needs an exponential number of measurements; the only exponential in the paper is the growing complexity of the N-representability conditions. The paper calls its hybrid quantum-stochastic algorithm a numerical proof of concept, a stochastic sequence of unitary evolutions refined against the known elements, tested on a Fermi-Hubbard ground state with and without added random noise; I found no measurement on quantum hardware, and near-term quantum devices appear only as a context for error mitigation.

Massaccesi et al. (arXiv:2603.13087) establish conditions under which the matrix completion of the 2-RDM is unique — when knowing a subset of matrix elements determines all the others exactly. The conditions depend on which elements are measured: certain patterns of known entries lock in the remaining entries through the N-representability constraints (the requirement that the 2-RDM must be derivable from some valid N-particle wavefunction).

The N-representability constraints are what make this different from generic matrix completion. In the general problem, completing a partially observed matrix is usually not unique — many matrices fit the observed entries. But the 2-RDM isn't an arbitrary matrix. It must satisfy positivity conditions (the 2-RDM and certain contractions must be positive semidefinite) and consistency conditions (partial traces must reproduce the 1-RDM). These constraints reduce the space of valid completions, and for the right pattern of observations, reduce it to a single point.

The practical validation uses a hybrid quantum-stochastic approach on the Fermi-Hubbard model. Quantum hardware measures the subset of matrix elements identified by the uniqueness conditions. A classical optimizer completes the remaining elements subject to N-representability. The completion matches the exact 2-RDM, confirming that the uniqueness conditions identified theoretically are sufficient in practice.