---
title: Number-Conserving Fermionic-Shadow Tomography
url: https://www.emergentmind.com/topics/number-conserving-fermionic-shadow-tomography
type: topic
---

# Number-Conserving Fermionic-Shadow Tomography

Number-conserving fermionic-shadow tomography is a classical-shadow protocol for fixed-particle-number fermionic states that uses random single-particle or orbital rotations commuting with the total-number operator, followed by occupation-basis measurement, to estimate many fermionic observables simultaneously. In the formulation of “Classical shadows of fermions with particle number symmetry” [2208.08964], the target state is an unknown \(\eta\)-fermion state \(\rho\) on \(\wedge^\eta(\mathbb C^n)\), and the protocol is designed to estimate all \(k\)-reduced density matrices (RDMs) with sample complexity controlled by \(\eta\) rather than by the ambient mode number \(n\). Subsequent work sharpened this perspective into a framework of number-conserving fermionic-shadow tomography based on random orbital rotations, proving that for every fixed order \(k\), all \(k\)-body fermionic correlations of an \(N\)-mode \(\eta\)-particle state can be simultaneously estimated with \(O_k(\eta^k/\varepsilon^2)\) samples, independent of \(N\), and that this dependence is information-theoretically optimal up to \(k\)-dependent constants [2606.30601].

## 1. Conceptual setting and provenance

The central task is the simultaneous estimation of fermionic correlation tensors constrained by particle-number symmetry. For a fixed-\(\eta\) state, the natural observables are \(k\)-body correlators or, equivalently, matrix elements of the \(k\)-RDM,
\[
\rho^{(k)\,p}_{\;\;\;\;\;q}
=
\operatorname{Tr}\!\left[
\rho\,
a_{p_1}^\dagger\cdots a_{p_k}^\dagger
a_{q_k}\cdots a_{q_1}
\right],
\qquad
p,q\in S_{n,k}.
\]
The defining feature of the number-conserving protocol is that both the measurement ensemble and the reconstruction map remain inside the fixed-particle sector, rather than treating the state as an arbitrary qubit state and only imposing symmetry afterward [2208.08964].

This line of work emerged from a broader fermionic classical-shadow program. “Fermionic partial tomography via classical shadows” introduced a protocol based on a discrete group of fermionic Gaussian unitaries and proved that estimating all \(k\)-RDM elements to additive precision \(\varepsilon\) requires
\[
O\!\Bigl(\tbinom{n}{k}\tfrac{k^{3/2}\log n}{\varepsilon^2}\Bigr)
\]
repeated state preparations. The same work also adapted the method to particle-number symmetry, halving the additional circuit depth at the cost of roughly \(2\)–\(5\times\) more repetitions in practice [2010.16094]. The 2022 particle-number-symmetric protocol replaced that symmetry-adapted variant by a scheme whose sample complexity depends on \(\binom{\eta}{k}\) rather than \(\binom{n}{k}\), yielding a super-exponential improvement when \(n\) can be arbitrarily larger than \(\eta\) [2208.08964].

A later development, “Provably Efficient Learning of Fermionic Correlations under Particle-Number Symmetry,” recast the same theme in terms of all \(k\)-body fermionic correlations of an \(N\)-mode \(\eta\)-particle state, established a matching lower bound \(\Omega_k(\eta^k/\varepsilon^2)\) for any adaptive protocol based on single-copy measurements, and thereby identified the \((\eta^k,\varepsilon)\)-dependence as optimal up to constants depending only on \(k\) [2606.30601].

## 2. Measurement ensemble and shadow formation

The measurement scheme starts from an unknown \(\eta\)-fermion state \(\rho\) on \(\wedge^\eta(\mathbb C^n)\). One draws a Haar-random single-particle rotation \(u\in U(n)\), promotes it to the \(\eta\)-particle rotation
\[
U_\eta(u)=\wedge^\eta u,
\]
and uses the fact that \([U_\eta(u),\hat N]=0\), so total particle number is conserved. After applying \(U_\eta(u)\), one measures in the occupational-number basis
\[
\{|z\rangle: z\in S_{n,\eta}\},
\qquad
S_{n,\eta}=\{z=(z_1<\cdots<z_\eta): 1\le z_j\le n\},
\]
recording the bitstring \(z\) with probability
\[
\langle z|U_\eta(u)\rho U_\eta(u)^\dagger|z\rangle.
\]
Each outcome \((u,z)\) is one fermionic classical shadow [2208.08964].

The 2026 formulation expresses the same scheme as a POVM on the \(\eta\)-particle sector. With \(u\sim \mathrm{Haar}(U(N))\), the induced orbital rotation is
\[
U_{(\eta)}(u)=u^{\wedge \eta},
\]
the single-copy POVM element is
\[
M(u,z)=U_{(\eta)}(u)^\dagger |z\rangle\langle z|U_{(\eta)}(u),
\]
and the ensemble \(\{M(u,z)\}_{u,z}\), with measure \(du\times(1/|S_{N,\eta}|)\), is informationally complete on the \(\eta\)-particle subspace. In that formulation it is also convenient to package the outcome into the one-particle projector
\[
R=u^\dagger P_z u
\]
on the Grassmannian \(\mathrm{Gr}_\eta(\mathbb C^N)\) [2606.30601].

The practical significance of this ensemble is that it preserves the physically relevant \(U(1)\) symmetry at the measurement level. The protocol therefore does not spend samples learning amplitudes or coherences outside the fixed-\(\eta\) manifold. A plausible implication is that the observed improvement in sample complexity is structurally tied to restricting both the quantum channel and the inverse reconstruction map to the symmetry sector, rather than merely post-selecting number-conserving outcomes.

## 3. Channel inversion and unbiased \(k\)-RDM estimators

The reconstruction problem is organized through the measurement channel
\[
M[\rho]
:=
\mathbb E_{u,z}\!\left[
U_\eta(u)^\dagger |z\rangle\langle z| U_\eta(u)
\right].
\]
For fixed particle number, this channel is invertible on \(\wedge^\eta U(n)\), giving the single-shot state estimator
\[
\hat\rho_{u,z}
=
M^{-1}\!\left[
U_\eta(u)^\dagger |z\rangle\langle z| U_\eta(u)
\right].
\]
The resulting single-shot estimator of a \(k\)-RDM matrix element is unbiased:
\[
\langle \hat D_q^p\rangle_{u,z}
=
\operatorname{Tr}\!\left[
(a_{p_1}^\dagger\cdots a_{p_k}^\dagger a_{q_k}\cdots a_{q_1})
\hat\rho_{u,z}
\right]
=
\langle q|\,U_k(u')^\dagger E_{\eta,k}U_k(u')\,|p\rangle,
\]
where \(u'=v_z^\dagger u\), \(U_k(u')=\wedge^k(u')\), and \(E_{\eta,k}\) is a diagonal estimation matrix of size \(\binom{n}{k}\times\binom{n}{k}\) whose \(r\)th diagonal entry depends only on \(s=|r\cap\{1,\dots,\eta\}|\) [2208.08964].

In compact form,
\[
E_{\eta,k}
=
\sum_{r\in S_{n,k}}
|r\rangle\langle r|\,
(-1)^{k+|r\cap[\eta]|}
\binom{k}{|r\cap[\eta]|}
\binom{\eta-|r\cap[\eta]|}{k-|r\cap[\eta]|}
\binom{n-\eta+|r\cap[\eta]|}{|r\cap[\eta]|}.
\]
This diagonal structure is the algebraic core of the protocol: the inverse channel is explicit, yet its action is organized by the overlap pattern between an index set \(r\) and the occupied reference set \([\,\eta\,]\).

The 2026 work rewrites the same inversion problem using contraction and extension maps,
\[
C_{\eta,k}:\operatorname{End}(H_\eta)\to \operatorname{End}(H_k),
\qquad
E_{k,\eta}:\operatorname{End}(H_k)\to \operatorname{End}(H_\eta),
\]
with
\[
\langle \underline p|C_{\eta,k}(X)|\underline q\rangle
=
\operatorname{Tr}[X\,a_{p_1}^\dagger\cdots a_{p_k}^\dagger a_{q_k}\cdots a_{q_1}],
\]
and gives the one-shot estimator
\[
\widehat D^{(k)}(R)
=
\sum_{t=0}^k
(-1)^{k+t}\binom{N+1}{t}
\frac{\binom{\eta-t}{k-t}}{\binom{k}{t}}
E_{t,k}(R^{\wedge t}).
\]
Equivalently, centering \(R\) by \(\widetilde R=R-(\eta/N)I\),
\[
\widehat D^{(k)}(R)
=
\sum_{a=0}^k \gamma_a\,E_{a,k}(\widetilde R^{\wedge a}),
\]
with coefficients \(\gamma_a\) given explicitly, and unbiasedness takes the form
\[
\mathbb E_R[\widehat D^{(k)}(R)]
=
C_{\eta,k}(\rho)
=
D_\rho^{(k)}.
\]
This reformulation makes the Grassmannian geometry and the dependence on centered minors explicit [2606.30601].

## 4. Variance bounds, sample complexity, and optimality

For the 2022 protocol, the average variance over all \(p,q\in S_{n,k}\) satisfies
\[
\langle \mathrm{Var}\rangle
:=
\mathbb E_{p,q}\bigl[\mathrm{Var}[\langle \hat D_q^p\rangle]\bigr]
=
\frac{\operatorname{Tr}[E_{\eta,k}^2]}{\binom{n}{k}^2}
-
\frac{\binom{n-k,\eta-k}^2}{\binom{n,\eta}^2\binom{n,k}}.
\]
A combinatorial bound gives
\[
\frac{\operatorname{Tr}[E_{\eta,k}^2]}{\binom{n}{k}^2}
\le
\binom{\eta}{k}
\Bigl(1-\frac{\eta-k}{n}\Bigr)^k
\frac{1+n}{1+n-k}.
\]
Hence, to drive the average variance below \(\epsilon^2\), it suffices that
\[
M
\ge
\binom{\eta}{k}
\Bigl(1-\frac{\eta-k}{n}\Bigr)^k
\frac{1+n}{1+n-k}\;
\frac{1}{\epsilon^2}.
\]
The dependence is independent of \(n\) except via the mild factor \(\bigl(1-(\eta-k)/n\bigr)^k\), and this is a super-exponential improvement over previous \(O(n^k/\epsilon^2)\) scalings when \(\eta\ll n\) [2208.08964].

The same work emphasizes two regimes. First, when \(n\) can be arbitrarily larger than \(\eta\), the gain over mode-number-dependent approaches is strongest. Second, even in the worst-case of half-filling, the protocol still provides a factor of \(4^k\) advantage in sample complexity. It also estimates all \(\eta\)-reduced density matrices, applicable to estimating overlaps with all single Slater determinants, with at most \(O(1/\epsilon^2)\) samples. In the detailed variance analysis this appears as
\[
Q_{n,\eta,\eta}
=
\operatorname{Tr}[E_{\eta,\eta}^2]/\binom{n}{\eta}^2
\le
4/3,
\]
so only \(O(1/\epsilon^2)\) samples suffice on average to estimate all \(\eta\)-RDM elements, independent of \(\eta\) or \(n\) [2208.08964].

The 2026 analysis gives a pointwise variance upper bound for each entry,
\[
\mathrm{Var}[\widehat D^{(k)}_{\underline p,\underline q}]
\le
C_k\,\eta^k,
\qquad
C_k=16(k+1)\sqrt{(4k)!},
\]
and therefore \(O(\eta^k/\epsilon^2)\) shots to achieve mean-squared error at most \(\epsilon^2\) for each entry. With median-of-means to boost success probability \(1-\delta\), the total copies are
\[
O_k(\eta^k/\epsilon^2\cdot \log(M_{\mathrm{obs}}/\delta))
=
O_k(\eta^k/\epsilon^2\cdot \log N/\delta).
\]
The same paper proves a matching lower bound \(\Omega_k(\eta^k/\epsilon^2)\) for any adaptive single-copy measurement protocol, using a two-hypothesis distinguishing framework and optimizing a block size \(m=2\eta\) [2606.30601].

A common misunderstanding is to read the \(O(1/\epsilon^2)\) statement as a uniform bound for arbitrary observables. In the cited results, that scaling is stated for estimating all \(\eta\)-RDM elements on average, whereas the general fixed-\(k\) guarantees scale as \(O_k(\eta^k/\epsilon^2)\) or through the explicit \(\binom{\eta}{k}\)-dependent bound above [2208.08964].

## 5. Computational structure and implementation

The protocol’s computational content is not limited to its sample complexity. A naïve evaluation of
\[
\langle q|U_k^\dagger E U_k|p\rangle
\]
would require \(O\!\bigl(\binom{n}{k}^2\bigr)\) time. The 2022 construction instead exploits the block-diagonal form of \(E_{\eta,k}\) and the fact that \(U_k(u')\) is a matchgate unitary. This reduces each matrix element to the evaluation of \(O(k)\)-by-\(O(\eta)\) submatrices of \(u\) and to Pfaffians of \(2k\times 2k\) matrices. By rewriting number operators in the Majorana basis and using fermionic linear optics Pfaffian formulas, one can compute all overlaps for fixed \(p,q\) in \(O(k^2\eta)\) time [2208.08964].

At the quantum level, the cost per shot is one depth-\(O(n)\) circuit implementing \(U_\eta(u)\) plus an \(\eta\)-particle measurement. The summary scaling is:
- quantum cost per shot: one depth-\(O(n)\) circuit implementing \(U_\eta(u)\) plus an \(\eta\)-particle measurement;
- sample complexity to reach mean-squared error \(\epsilon^2\) on all \(k\)-RDMs:
\[
M
=
O\!\bigl(
\binom{\eta}{k}(1-(\eta-k)/n)^k(n/(n-k))/\epsilon^2
\bigr);
\]
- post-processing per \(k\)-RDM from one shot: \(O(k^2\eta)\);
- for \(k=\eta\), one recovers \(O(1/\epsilon^2)\) sample complexity even for the largest RDM [2208.08964].

The 2026 pseudocode formulation makes the classical workflow explicit. For shots \(\ell=1,\dots,L\), one samples \(u_\ell\sim \mathrm{Haar}(U(N))\), measures after \(U_{(\eta)}(u_\ell)\), forms the one-particle projector \(R_\ell=u_\ell^\dagger \operatorname{diag}_{z_\ell}u_\ell\), computes centered minors
\[
m_a(R_\ell)=(R_\ell-(\eta/N)I)^{\wedge a},
\]
and updates all entries by
\[
\widehat D^{(k)}_{\underline p,\underline q}
\;+=\;
\sum_{a=0}^k
\gamma_a
\langle \underline p|E_{a,k}(m_a(R_\ell))|\underline q\rangle.
\]
In that presentation, memory is \(O(|S_{N,k}|^2)\) and classical time per shot is \(\mathrm{poly}(N,k)\) [2606.30601].

## 6. Related protocols, distinctions, and research trajectory

Number-conserving fermionic-shadow tomography sits within a larger family of symmetry-aware shadow methods, but those methods target different objects and use different ensembles.

| Work | Core idea | Stated result |
|---|---|---|
| [2010.16094] | Fermionic Gaussian shadows with a particle-number-symmetry adaptation | Depth halved at the cost of roughly \(2\)–\(5\times\) more repetitions |
| [2208.08964] | Haar-random single-particle bases that conserve particle number | Super-exponential improvement when \(\eta\ll n\); \(O(k^2\eta)\) post-processing |
| [2606.30601] | Random orbital rotations with matching lower bound | \(O_k(\eta^k/\varepsilon^2)\) samples and \(\Omega_k(\eta^k/\varepsilon^2)\) lower bound |
| [2311.09291] | Local “All-Pairs” protocol with one layer of two-body gates | \(\mathrm{poly}(V)\) samples for arbitrary few-body observables |
| [2511.09717] | Constrained shadow tomography for 2-RDM reconstruction | DQG-constrained SDP with nuclear-norm regularization |
| [2404.19211] | Two-copy triply efficient shadow tomography for local fermionic observables | Single-copy sample-efficient schemes are provably impossible for local fermionic observables |

The distinctions are substantive. The orbital-rotation protocols of [2208.08964] and [2606.30601] are single-copy, fixed-particle-number schemes for simultaneously estimating all \(k\)-RDM entries or all \(k\)-body fermionic correlations. By contrast, the “All-Pairs” protocol applies one layer of random two-body gates followed by occupation-basis measurement and yields \(\mathrm{poly}(V)\) samples to reconstruct arbitrary few-body observables, together with an \(O(V)\)-time post-processing algorithm for fixed few-body weight [2311.09291]. “Constrained Shadow Tomography for Molecular Simulation on Quantum Devices” uses one-body fermionic Gaussian unitaries to generate shadow data for the 2-RDM and then solves a bi-objective SDP imposing \(N\)-representability constraints and nuclear-norm regularization, with main costs scaling as \(O(r^6)\) in floating-point operations and \(O(r^4)\) in memory [2511.09717].

The topic also intersects with quantum chemistry ansatz construction. “Shadow Ansatz for the Many-Fermion Wave Function in Scalable Molecular Simulations on Quantum Computing Devices” measures classical shadows of the contracted Schrödinger equation residual and builds a product of number-conserving transformations
\[
|\Psi_{\rm shadow}\rangle
=
U_K\cdots U_2U_1|\Phi_0\rangle,
\qquad
U_k=e^{-\tau_k S_k},
\]
where \([S_k,N]=0\). That work states \(O(N_o^2\log N_o/\epsilon^2)\) measurement settings for the residual and quadratic rather than quartic scaling in orbital count for both measurements and circuit depth [2408.11026]. This is number-conserving and shadow-based, but its primary objective is variational wave-function construction rather than direct \(k\)-RDM tomography.

An additional nuance concerns impossibility and optimality statements. “Triply efficient shadow tomography” proves that sample-efficient schemes for local fermionic observables are provably impossible using only single-copy measurements, and introduces a two-copy Bell-measurement framework that is triply efficient for local fermionic observables [2404.19211]. That result concerns a different observable class and protocol model than the fixed-\(k\), fixed-particle-number single-copy setting of [2208.08964] and [2606.30601]. Conversely, within the latter setting, the 2026 lower bound shows that the \(\eta^k/\epsilon^2\) dependence is already optimal up to \(k\)-dependent constants [2606.30601].

Numerically, the 2026 paper reports that for estimating all 1-RDM entries with \(N=100\), \(\eta=20\), \(\varepsilon=10^{-2}\), and success at least \(0.99\), the orbital-rotation shadow uses \(\mathrm{Var}(\widehat D^{(1)}_{p,q})\le \eta+2\approx 22\), hence \(L\simeq 22/\varepsilon^2\simeq 2.2\times 10^5\) shots, while a FU-U shadow gives \(L\sim O(N/\varepsilon^2)\simeq 10^6\); the stated outcome is a reduction in query count by roughly an order of magnitude compared with state-of-the-art methods for one-body correlation estimation [2606.30601]. This suggests that particle-number symmetry is not merely a formal constraint but a quantitatively exploitable structural resource for fermionic observables estimation.

Source: https://www.emergentmind.com/topics/number-conserving-fermionic-shadow-tomography