Optimal Qudit Overlapping Tomography

• The paper introduces a resource-efficient protocol leveraging overlapping measurement configurations to reconstruct all k-body marginals in n-qudit states.
• It employs generalized Gell-Mann matrices and covering arrays to reduce measurement redundancy and minimize experimental switching costs.
• The approach optimizes scheduling via dynamic programming and heuristics, enabling scalable tomography in high-dimensional quantum systems.

Optimal qudit overlapping tomography is a resource-efficient methodology for reconstructing all $k$-body marginals of $n$-qudit quantum states using a minimal set of global measurement settings. The approach leverages overlapping measurement configurations, constructed from generalized Gell-Mann matrices, to efficiently cover all possible subsets required for tomography — significantly reducing the measurement overhead common in high-dimensional or multi-body quantum systems. The underlying combinatorial and optimization frameworks enable explicit constructions and practical scheduling algorithms that further minimize experimental switching costs. This methodology permits scalable characterization of qudit states, essential for advancing quantum computing and communication platforms (Ma et al., 15 Jan 2026, Ivanova-Rohling et al., 2020).

1. k-Body Marginals and Overlapping Tomography

For an $n$-qudit state $\rho$ on $(\mathbb{C}^d)^{\otimes n}$, each $k$-body marginal $\rho_S$ — where $S\subset\{1,\dots,n\}$ and $|S|=k$ — is defined as $\rho_S = \operatorname{Tr}_{\bar S}(\rho)$. In the generalized Gell-Mann (GGM) basis, $\rho$ is expanded as

$$\rho = \sum_{(i_1,\dots,i_n)\in\{0,\dots,d^2-1\}^n} a_{i_1\dots i_n}\, \lambda_{i_1} \otimes \cdots \otimes \lambda_{i_n}$$

where monomials with $t$ nonzero indices correspond to $t$-body marginals.

Naïve tomography of all $k$-body marginals requires $(d^2-1)^k\cdot \binom{n}{k}$ distinct settings. Overlapping tomography exploits the fact that a single setting $\lambda_{i_1}\otimes\cdots\otimes\lambda_{i_n}$ contributes simultaneously to all $k$-subsets for which exactly $k$ indices are nonzero. By distributing nonzero operators across configurations, one strategically covers the full set of marginals using a far smaller set of measurement settings (Ma et al., 15 Jan 2026).

2. Generalized Gell-Mann Matrix Framework

The GGM matrices $\{\lambda_0, \lambda_1, \ldots, \lambda_{d^2-1}\}$ provide a Hermitian basis for $d$-level systems, where $\lambda_0=I_d$ and the remaining $\lambda_i$ are traceless. The basis includes symmetric off-diagonals $$\Lambda_s^{jk}=|j\rangle\langle k| + |k\rangle\langle j|$$ ($1\leq j<k\leq d$), antisymmetric off-diagonals $$\Lambda_a^{jk}=-i|j\rangle\langle k| + i|k\rangle\langle j|$$, and diagonal generators

$$\Lambda^l = \sqrt{\frac{2}{l(l+1)}} \left(\sum_{j=1}^l |j\rangle\langle j| - |l+1\rangle\langle l+1| \right)$$

for $l=1,\dots,d-1$. These satisfy $$\operatorname{Tr}(\lambda_\alpha\lambda_\beta) = 2\delta_{\alpha\beta}$$ for $\alpha,\beta\geq 1$ and $\operatorname{Tr}(\lambda_0\lambda_\alpha)=0$. Thus, the density matrix decomposition for $n$ qudits proceeds via tensor products of these matrices, and the tomography protocol interprets each row as a tensor product configuration specifying which local operator is applied on each qudit (Ma et al., 15 Jan 2026).

3. Combinatorial Covering Arrays and Measurement Settings

Efficient overlapping tomography is achieved through combinatorial designs known as covering arrays. A covering array $\operatorname{CA}(N; t, k, v)$ is an $N\times k$ array on an alphabet of size $v$; every choice of $t$ columns features every possible $t$-tuple at least once across the $N$ rows. In qudit tomography, $k=n$, $v=d^2-1$, and $t$ is the size of the marginals required.

Each row of the covering array describes a global measurement setting, fully specifying the local GGM operator per qudit. The minimum number $\varphi_t(n, d)$ of measurement settings required to reconstruct all $t$-body marginals is exactly the covering number $\mathrm{CAN}(t, n, d^2-1)$. Two explicit constructions — the “zero-sum” and “Bush” array methods — achieve the lower bound $\mathrm{CAN}(t, k+1, v) = v^t$ for $n=k+1$ and in prime-power cases, respectively. In these constructions, every $k$-subset is covered optimally such that all possible $v^k$ operator patterns are present (Ma et al., 15 Jan 2026).

Construction	Applicability	Minimum settings
Zero-sum	$n=k+1$	$(d^2-1)^k$
Bush’s construction	$v=d^2-1$ prime power, $v>k$	$(d^2-1)^k$

4. Explicit Bounds and Constructions for Qutrit Pairwise Tomography

For $n$-qutrit ($d=3$) systems with pairwise ($t=2$) tomography, $v=8$. The established bound is

$$\varphi_2(n,3) = \mathrm{CAN}(2, n, 8) \leq 8 + 56 \left\lceil \log_8 n \right\rceil$$

using a construction based on known $\operatorname{CA}(64;2,8,8)$ arrays. The procedure involves mapping system indices to base-$8$ digits and leveraging constant and patterned rows from the array to guarantee coverage of all ordered pairs $(i,j)$ for any two qudits. This ensures that all $2$-body marginals are reconstructable with an explicit, efficiently constructible measurement schedule. Any pair of columns (qudits) is separated either by a constant row or dedicated pattern block, yielding the full operator set without redundancy (Ma et al., 15 Jan 2026).

5. Optimization of Measurement Order and Switching Costs

Experimental overhead can be dominated by switching costs incurred between global measurement configurations. These costs are modeled by the Hamming distance $d(M_i,M_j)$ between settings $M_i$ and $M_j$, where each vector component specifies the local operator index. Minimizing the total switching cost across all settings requires solving the shortest Hamiltonian path problem on the associated complete graph.

• For $N\leq 12$: exact dynamic programming (Held–Karp algorithm) is feasible.
• For $12<N\leq50$: a cluster-based nearest-neighbor heuristic followed by 2-opt local search is applied.
• For larger $N$: simulated annealing or greedy randomized adaptive search is wrapped around local search moves.

Numerical trials for arrays of up to $N\approx 33$ show that optimized orderings reduce cumulative switching costs by approximately $50\%$ compared to naïve ordering. The following pseudocode structure formalizes this optimization:

Input: settings M[1..N], cost C[i,j]=Hamming(M[i],M[j]) Phase 1: Build cost matrix C in O(N²·n). Phase 2: if N≤12 then HeldKarp(C) else if N≤50 then π0 ← ClusteredNearestNeighbor(C) π* ← TwoOptLocalSearch(π0,C) else π0 ← ClusteredNearestNeighbor(C) π* ← SimulatedAnnealing(π0,C) Phase 3: Compute total cost = ∑ C[π*(s),π*(s+1)] Output: π*, cost, improvement over random

The significant reduction in experimental configuration switching directly improves the throughput and practicality of large-scale qudit tomography (Ma et al., 15 Jan 2026).

6. Numerical Optimization and High-Dimensional Extensions

Overlapping tomography with subspace projectors may be formulated as a numerical optimization problem. For dimension $d$, one selects $m$ rank-$k$ projectors $\{P_i\}_{i=1}^{m}$, constructing their traceless components $Q_i=P_i-(k/d)I$. The Gram matrix $G_{ij}=\operatorname{Tr}(Q_iQ_j)$ encodes subspace overlaps. Optimizing measurement spread amounts to maximizing the geometric volume $\mathcal{Q} = \sqrt{\det G}$, or equivalently maximizing the minimal eigenvalue of $G$.

For prime-power dimensionality, mutually unbiased subspace constructions provide analytic solutions saturating the bounds, as shown for $d=2^n$ via rank-$(d/2)$ projectors built from MUBs. For composite dimensions, as in the qubit–qutrit ($d=6$) case, semi-definite programming (SDP) and derivative-free search techniques are employed:

• Objective: maximize $\min\operatorname{eig}(G)$ with $P_i\succeq0$, $P_i^2=P_i$, $\operatorname{Tr}P_i=k$.
• Implementation involves unitary parametrizations and established SDP solvers.
• Results at $d=6$: numerical optimum closely approaches the theoretical upper bound, with relative deviation $\sim 1.3\times 10^{-4}$, entailing negligible impact on measurement repetition requirements.

The methodology generalizes readily: for subsystem measurements of dimension $d_A$ in $d=d_Ad_B$, projectors of rank $k=d_B$ are used, and SDP scaling is manageable for moderate $d$. For prime-power $d$, complete designs based on MUBs are directly applicable; for composite $d$, numerical approximations remain highly effective (Ivanova-Rohling et al., 2020).

7. Significance and Applications

Optimal qudit overlapping tomography addresses the exponential scaling bottleneck inherent to traditional quantum state tomography by exploiting efficient combinatorial and optimization-based measurement scheduling. Explicit array constructions and proven bounds provide practical protocols for tomography in large and high-dimensional systems, with direct ramifications for characterization tasks in quantum communication, computation, and metrology.

Efficient measurement order scheduling further lowers experimental overhead, making the approach particularly valuable in settings where rapid configuration switching is costly. Extensions to arbitrary dimensions and subsystem-based tomography are supported both analytically (prime-power $d$ via MUBs) and numerically (hybrid SDP schemes for composite $d$), ensuring broad applicability.

This framework connects combinatorial design theory with quantum information processing, leveraging classical covering arrays and modern optimization techniques to address fundamental measurement resource constraints in quantum tomography (Ma et al., 15 Jan 2026, Ivanova-Rohling et al., 2020).