WorksPhysics and Astronomy
Third-Order Quantum Information from Distributed Randomized Measurements
Abstract
Randomized measurements offer a way to probe nonlinear properties of quantum states without reconstructing their full density matrices. For states shared between distant laboratories, we study products of three outcome probabilities measured at the same local settings and then averaged over independent local random unitaries. We determine, for an arbitrary number of parties, which third-order local-unitary invariant combinations these averages retain and which they cannot separate. The accessible information is encoded in algebraic invariants of the quantum state and is reconstructed by analysing the permutation symmetries induced by the distributed measurement protocol. Exploiting these symmetries, the reconstruction problem collapses, regardless of the number of measurement outcomes, to the symbolic inversion of a 3 x 3 matrix. As a result, nonlinear information can be extracted without inverting the exponentially large matrices that typically arise in distributed multipartite quantum systems.
Introduction
Many properties relevant to quantum-state characterization are nonlinear functions of the density matrix, yet can be determined without full-state reconstruction [1, 2, 3, 4, 5, 6]. Randomized measurements provide access to such information through products of outcome probabilities averaged over random measurement bases [7, 8, 9]. For spatially separated subsystems, the central question is which nonlinear properties can be recovered from local measurements and the classical records shared between laboratories.
We study third-order correlators obtained by measuring three independent preparations at the same local unitary setting and averaging over Haar distribution. The protocol requires only local rotations, projective local measurements, and classical post-processing, with no global measurement or coherent coupling between copies. After averaging, each local outcome triple is specified by its equality pattern: all distinct, exactly one equal pair, or all equal. Replacing repeated averaged entries by these patterns loses no further information. The local Haar averages assign identical coefficients to some distinct invariants, so they appear in the measurement equations only through sums. We ask which invariant combinations these equations determine and which they cannot separate.
Classical-shadow protocols use recorded settings and outcomes to estimate selected observables [10]. Elben et al. [11] combine records from independently sampled settings to estimate partial-transpose moments individually. Other randomized-measurement schemes access additional invariant polynomials or optimize estimation costs [12, 13, 14, 15].
Our reconstruction takes only the averaged outcome correlators as input. Unlike estimators that use recorded settings, it requires neither calibration nor storage of each individual unitary matrix: one only needs to identify shots taken at the same setting. This removes the need to characterize every random rotation for post-processing, while retaining the assumptions of Haar sampling (or an exact 3-design) and the specified measurement model. For resource tests built from the retained invariant combinations, only the combinations required by the test need to be reconstructed.
We solve this identifiability and reconstruction problem for an arbitrary number of parties and local dimensions. Simultaneous relabelling of the three copies organises the retained coordinates into permutation orbits. A change of basis, independent of the local Hilbert-space dimensions, then separates the reconstruction map into independent sectors built from matrices and scalars.
The construction recovers the known bipartite reconstruction structure [16, 17], including the fact that the global and partial-transpose third moments enter only through their sum, and extends that structure to arbitrary party number. Its contribution is an exact characterization of the nonlinear information available from distributed measurements.
Section II defines the protocol. Sections III and IV develop the one- and two-party constructions, and Sec. V establishes their multipartite extension. Section VI constructs the reconstruction sectors, followed by the main theorem in Sec. VII. Section VIII then examines partial-transpose invariance and the information limits of the averaged correlators.
Randomized measurements
Let be a density matrix on . Party applies a unitary and measures in the computational basis . Write for the setting and for a joint outcome tuple. The conditional probability is
For three independently prepared copies measured at the same product setting , the joint conditional probability of the outcome tuples factorizes as
Each probability is linear in , so their product is cubic. The three shots use the same setting, and then their product is averaged over independent local Haar distributions,
This probes third-order information without a coherent measurement coupling the copies. Collecting all outcome triples gives the data vector . The integrand contains three matrix entries of each local unitary and three conjugate entries. An exact unitary 3-design, an ensemble matching these Haar moments, therefore gives the same mean correlators [18, 19]. For a qubit register at each party, the multiqubit Clifford group provides such an ensemble [20]. We first develop the construction for to introduce the building blocks for the main theorem.
One party
Equality patterns and local cycle merging
For one party, the Haar average in Eq. (3) connects measured outcome triples to scalar invariants of . Weingarten calculus evaluates the required integral as a sum over permutations of the three copy positions [21, 22, 23]:
and the formula (2.3) takes the form:
Here tests equalities among the measured outcomes, whereas connects indices of the three density-matrix factors. These two roles define the data and invariant coordinates below.
Equality patterns
The factor iff all outcomes linked by are equal, e.g. requires , whereas requires . Consequently, the averaged entry depends only on the equality pattern of the outcome triple. We use the ordered set
where denotes three distinct outcomes, denotes equality only between positions , and denotes three equal outcomes.
For example, and both have pattern and therefore the same averaged entry . The vector collects one such value per pattern; its entries are representative correlators, rather than total pattern-event probabilities.
Evaluating the outcome equality tests on each pattern defines the matrix . With permutation columns ordered as , it is
Table 3.4.
Thus encodes which permutation constraints each equality pattern satisfies.
Permutation contractions
The index connections specified by can be expressed through the unitary permutation operator , defined by
This convention gives . The scalar obtained by closing the index connections is
These contractions are invariant under unitary changes of basis because commutes with [24, 25, 26, 27, 28, 29].
For one party, the cycle structure of determines which state factors are joined. The identity, a transposition, and a three-cycle give, respectively, , , . Accordingly,
The six labelled coordinates therefore contain only three distinct moment values.
Local cycle merging
Let . It assigns to a , permitted by the equality pattern by , a linear combination of unitary invariants encoded by . It depends only on whether its permutation argument is the identity , a transposition , or a three-cycle :
Therefore Eq. (5) can be reformulated as
The two last columns of associated with and coincide, hence they can be rewritten as one column multiplying the sum of last two entries of . Define the local cycle-merging map by
It retains the sum of the cycle coordinates and annihilates their difference. For one party, those coordinates already coincide, so this merging removes no information. Its information-losing consequence for distinct invariants will appear in the two-party case. Defining as with the last column removed and one can rewrite the equation (14) as
where
We label the retained coordinates in by , matching the identity to , each transposition to , and the cycle sum to . These labels match coordinates with different meanings: denotes a cycle sum in , whereas three equal outcomes in .
The map is the local building block used at every party in the multipartite construction. The pole at in Eqs. (10)–(12) occurs because one of the five outcome patterns is absent for qubits [32].
Orbit reduction
Relabelling the three identical copies does not change a contraction. Indeed, and , so
Thus contractions are equal on each conjugation orbit. The same relabelling leaves the probability product unchanged and acts on equality patterns as
There are therefore three pattern orbits: , the three labels, and . Their data coordinates are , where is the common value of the three labelled entries.
As contractions on an orbit are equal, we change the equality-pattern-labelled coordinates to orbit-labelled coordinates, summing in the columns related to permutations of the same orbit. The column-merging is realised by the right multiplication with the matrix :
The same applies to renumbering of outcomes in — these belonging to the same permutation orbit are equal and hence are realised by identical rows in . We remove the duplicates by averaging over orbits:
Substituting and applying from left to Eq. (17) gives the in the orbit space
The factor collects the three identical transposition coordinates, whereas retains the cycle-sum convention. To reconstruct the invariant coordinates , one only needs to invert the one-party matrix :
The striking consequence, which we prove at the end of the paper, is that the many-party reconstruction problem collapses to this same inverse and scalar blocks. Thus the apparent growth of the full reconstruction matrix, studied in the proper basis, does not introduce any new nontrivial matrix inversion.
For a normalized state, ; retaining this coordinate keeps the cubic map homogeneous and makes its normalization explicit. The matrix will also form the blocks of the multipartite reconstruction.
Finally, representative correlators are converted to event probabilities by counting outcome realizations. The local multiplicities are
There are three labelled patterns, so normalization reads
These multiplicities convert measured pattern frequencies into the representative coordinates required by the inverse map. Appendix B extends this conversion to multipartite orbit events.
Two parties
Equality patterns and local cycle merging
For two parties, independent local Haar integration gives the tensor product of the one-party maps. The new ingredient is the relative arrangement of the copy labels at and .
Let act on . Grouping the three copies of each party together, define
The vector collects these labelled contractions. Each party also supplies one equality-pattern label, giving . Tensoring the one-party relation yields
Thus the same local cycle-merging map acts independently on the contraction label at each party.
A coordinate without an label is unchanged by , for example, . One label sums two cycle orientations,
whereas two labels sum all four orientation pairs:
The measurement map therefore retains this sum before any orbit reduction is performed. The orbit classification below identifies the physical invariants entering it.
| Contraction coordinate | Orbit size |
| 1 | |
| 3 | |
| 2 | |
| 3 | |
| 6 | |
| 3 | |
| 6 | |
| 2 | |
| 6 | |
| 2 | |
| 2 |
caption: TABLE I. The eleven diagonal-conjugation orbits of bipartite contractions [16, 17]. Here , , , , and . The operation is partial transposition on .
Orbit reduction
The three copy positions label complete bipartite preparations, so a relabelling must act simultaneously at both parties. The resulting diagonal conjugation action is
Invariance due to identical copies , as in the one-party case, gives . An orbit consists of the distinct pairs generated by these six relabellings. There are eleven contraction orbits. Table I lists their representative values containing the physical information—the local unitary invariants of .
In particular, equal cycle orientations give , while opposite orientations give . Each class occurs twice in Eq. (30), so
Unlike the two cycle coordinates for one party, and need not agree. The local cycle merging therefore retains their sum but cannot separate their difference.
On the data side, simultaneous relabelling acts on equality-pattern pairs through
The eight local-type pairs other than each form one orbit. The pairs split into two orbits according to whether the equalities involve the same pair of shots, , or different pairs, . Table II gives all ten orbits. In the table order, the representative data values and matching merged contractions are
Table 1.
The factors of two follow from : each single- coordinate sums two equal contractions, while the coordinate contains two copies of each cycle orbit. The normalization convention for the data coordinates is the same as in the one-party case of Eq. (26).
To express the map that relates data and invariants in these ten coordinates for both and , let be the pattern orbits in Table II. Generalize and , the embedding and extraction maps of Eqs. (20) and (21), by
| Orbit | Equality pattern of | Size |
| 1 | ||
| 3 | ||
| 1 | ||
| 3 | ||
| 3 | ||
| 6 | ||
| 3 | ||
| 1 | ||
| 3 | ||
| 1 |
Table II. The ten orbits of labelled equality-pattern pairs. The pair labels range over . Common relabelling preserves whether the parties select the same or different pairs of shots.
where and . Here embeds the ten orbit coordinates into the 25 labelled coordinates by assigning one if the pair belongs to the orbit . Conversely, extracts one coordinate per orbit by averaging the labelled entries in that orbit. Hence .
Both labelled vectors and are constant on the orbits, so
Substituting the first relation into Eq. (28) and applying gives
This orbit reduction removes repeated coordinates without further loss of the information retained by . Figure 1 summarizes these steps in the multipartite notation introduced in the next section and the solution for that expresses from will be obtained as an instance of the general theorem for arbitrary in Sec. VII A.

Figure 1. From full labelled coordinates to the reconstruction map . Horizontal arrows relate state invariants to measured averages through Haar integration. Equality-pattern reduction removes repeated outcome entries, whereas local cycle merging by adds the two cycle orientations (e.g. (32)) and removes access to their differences. Simultaneous copy relabelling then gives one coordinate per orbit in each column, without further information loss. The resulting map is reconstructed blockwise by the theorem.
Arbitrary parties
Equality patterns and local cycle merging
The two-party construction extends by applying the same local maps at every party. A tuple specifies the contraction
As before in Eq. (27), tensor factors are grouped by party. For arbitrary party number, the full contractions need not be real. Since is Hermitian and , complex conjugation gives
For one or two parties, the inverse tuple belongs to the same diagonal-conjugation orbit, so each contraction is real. For three or more parties, this need not hold.
The merged vector nevertheless remains real. To see this, write the operators associated with its local labels as
Each component is then
Both operators inside the trace are Hermitian, so cyclicity of the trace makes this expression real.
Denote the one-party coordinate space by , with its standard orthonormal basis. Tensoring the local relation gives
Although the map factorizes, the input and data vectors, respectively and , generally do not: both retain correlations among the parties.
Orbit reduction
As for two parties, one common relabels the three preparations. The local pattern action in Eq. (19) defines the matrices
acting on and , respectively. The retained operators in Eq. (39) obey , defining the same action both for the pattern equality of experimental data and the invariant coordinates. Indeed, the action fixes , sends to , and permutes the two three-cycles while preserving their sum.
Relabelling the three probability factors leaves their product unchanged. Likewise, relabelling identical global copies leaves unchanged. Thus
Both labelled vectors therefore lie in the invariant subspace : their entries are constant on each simultaneous-relabelling orbit in . One coordinate per orbit suffices. Denote the number of orbits by ; its count is derived in Appendix A.
Extend the two-party embedding and extraction maps by setting, for each orbit ,
Here embeds the orbit coordinates into the full labelled space by assigning one to all labelled pattern tuples in the same diagonal orbit. Conversely, extracts one coordinate per orbit by averaging over its labelled members. Consequently, . Define
Since all entries within an orbit agree, repeating each extracted value recovers the original labelled vectors:
Thus these coordinate reductions are reversible on the invariant subspace.
Substituting into Eq. (41) and applying gives
where . The dimension sum in Eq. (A5) gives . Storing a dense matrix requires memory, and conventional elimination costs arithmetic operations; both grow exponentially with party number. A numerical inverse would recover the coordinates without revealing which invariant combinations are actually independent. We therefore decompose the map into symmetry-resolved sectors, where every nontrivial matrix inversion reduces to the same one-party blocks, together with scalar weights.
Reconstruction sectors
The orbit reduction identifies the independent coordinates of the data and invariant vectors. In this section, we introduce a second coordinate system that makes the reconstruction map easier to analyze and invert.
Local invariant and zero-sum subspaces
Copy relabelling fixes and , but permutes the three labels. We separate their common component from two orthogonal zero-sum components by choosing
In the ordered basis , the change-of-basis matrix is
Its columns form an orthogonal basis, without normalizing the vectors: . For , the new coordinates are
The first three columns of are , and the first three rows of are .
In this basis, relabelling leaves the first three coordinates unchanged. The remaining two transform among themselves:
where, for two generators of ,
If a vector were unchanged by both generators, the two invariance equations would give . The vectors invariant under every relabelling are therefore precisely those whose last two coordinates vanish: , , so that . Relabelling preserves as a subspace, although contains no nonzero vector invariant under every relabelling.
As , then does not mix and , hence it is block-diagonal with respect to this basis. Its block commuting with both displayed matrices and must be scalar; this is the instance of Schur’s lemma used here. The change of basis gives
with . The first block is the one-party map . The second says that multiplies every zero-sum vector by the same scalar. Although alone has no invariant vector, tensor products of factors can have invariant combinations, as the next subsection shows.
Invariant tensor sectors
The orbit map still couples many coordinates. We now use the local decomposition to identify subspaces on which the measurement map acts independently; their invariant parts will become the diagonal blocks in the theorem.
The -party orbit space splits into a direct sum of tensor sectors:
where . To select the component in each sector, use the local orthogonal projectors. In the ordered basis , they are
The factor accounts for . Thus keeps the entries and replaces the three entries by their average; keeps their zero-sum deviations. For a choice , the tensor projector projects onto . The local relations and give
Both local maps and preserve and , by the Eq. (51). They therefore commute with . The commutation property extends to each sector:
and hence factorises by sectors (has block-diagonal form with blocks supported on ), as do.
Preserving a sector does not mean that every vector in it is unchanged by relabelling. On the other hand, the physical data and merged-contraction vectors and are invariant by Eq. (5.7), and their sector components inherit this property. Therefore, their sector components live in —the subspace of vectors in the sector invariant with respect to common relabelling. The group-average Reynolds projector onto the full invariant space is
Since commutes with every , the product projects onto . tells us how many independent reconstruction coordinates that sector supplies. As commutes with : the latter is the identity on , while is scalar on . Tensoring the commutation relation gives . Thus preserves the invariant subspace. In particular, its action on the orbit embedding satisfies
This identifies the map on the space of orbits as the restriction of the map on the equality-pattern space to the invariant coordinates. To count explicitly the dimension of the invariant subspace , define
and let , . After grouping the factors first, pointwise invariance of gives
Hence only the invariant subspace of is left to be identified. The dimension of the invariant subspace, derived in Appendix A, is
.
Here denotes the one-dimensional empty tensor product. The first values are , , and . The vanishing value means that a sector with just one zero-sum factor carries no invariant component of the measured data. Therefore the sectors contributing to the invariant subspace are
For two parties, contributes nine coordinates and contributes one; and contribute none; constituting the 10-dimensional orbit space. For three parties, , the three placements of , and give coordinates. More generally, the dimension sum
agrees with the orbit count derived in Appendix A. Thus the invariant sectors supply a complete coordinate basis for the data already identified by orbit reduction.
Sector coordinates
The preceding subsection identifies the invariant subspace within each tensor sector. To write the restriction of to these subspaces, we need a basis for their coordinates and a way to convert back to the orbit coordinates defined by the measured data.
For each , choose a matrix whose independent columns span , and set . One explicit construction is to select independent columns of the projector
Its image is exactly . The factor averages over the same relabelling at all positions, while restricts each factor to . The two projectors commute, so their product is a projector onto an intersection of and and hence has the rank . As no non-zero invariant vector exists in , a single factor kills the invariant subspace of a tensor sector.
At each position we pick one of the three columns of ; for the positions jointly, we use one of the columns of . Taking all tensor products of these basis vectors and restoring the original party order gives a basis of with columns. The embedding of is:
Its columns form a basis of . Indeed, both and have independent columns, and only permutes tensor factors.
The inverse permutation restores the original party order; the sector coordinates retain the column order of . This product convention determines the tensor form of the blocks in the theorem.
Each embeds coordinates from one sector. To describe the embedding of all invariant spaces of subsequent sectors, one performs the horizontal concatenation of the sector embeddings: .
Because orbits do not change under the action of the group, the orbit space is a subspace of . While the dimension of the orbit space and the invariant space agree, it is the same subspace. The two embeddings and assign different coordinates to the same vector: uses orbit basis, whereas uses the sector bases. We need the matrix that converts the latter coordinates into the former. Applying the orbit extraction map to each column of gives
The second equality holds because acts as the identity on the invariant subspace, spanned by the columns of . Thus changes coordinates of a fixed vector in from sector coordinates to orbit coordinates:
Vice versa, define
The concatenation of these left inverses vertically in the same sector order forms . Orthogonality between sectors then gives , while . Consequently, , and . See (53). The inverse converts measured orbit data into the sector coordinates on the direct sum of and . This is the change of basis used in the main theorem below as represented in Figure 2, which completes the path begun in Figure 1.

Figure 2. From the orbit coordinates at the bottom of Fig. 1 to independent reconstruction sectors. The vertical arrows are reversible changes of coordinates, with the same matrix for the retained invariants and measured data.
Structural theorem
The theorem shows how to obtain the physical information in from the averaged data of (3) analytically.
Theorem 1. Let , and use the orbit map and sector coordinate change defined in Eqs. (47) and (61). For each contributing sector , put and
In the product basis of Eq. (60),
where
The block has dimension . Because each is invertible and each is nonzero, is invertible.
Proof. Fix a contributing sector , and retain its factor sets and their sizes from the sector construction. The operator in Eq. (60) groups its factors before its factors. Hence
This reordering keeps each dimension attached to its party; the dimensions need not be equal. From the two local actions in Eq. (51) then
The operator before acts as the same scalar on all of , and therefore on the columns of . Substituting Eq. (65) into the sector embedding (6.13), and using Eq. (64), gives
with as stated in Eq. (63). Concatenating Eq. (66) over the contributing sectors yields
The relation (6.7) and the basis relation (6.14) also give
Applying the left inverse from Eq. (62) to Eqs. (67) and (68) proves the block identity Eq. (63). Finally, every has the inverse in Eq. (24), and each in Eq. (51) is nonzero. Thus every block is invertible. The basis change then makes invertible as well.
Thus each sector satisfies its own reconstruction system,
Its inverse requires only the known one-party inverse matrices and a scalar rescaling :
Equation (69) is the central result. As we announce below Eq. (24), even if explodes as , we discover that inverting never takes more than . A python notebook, where the reconstruction is implemented symbolically in SymPy is available in Ref. [33].
For measured data, Appendix B explains how to obtain from event frequencies, including the outcome and orbit multiplicities. Inserting this vector into Eq. (69) gives estimates of the retained invariant combinations. If a resource test uses only selected combinations, its linear input map can be composed with Eq. (69) in advance, so the remaining invariant coordinates need not be estimated separately. Finite-size entanglement certification from second- and third-order invariants provides a concrete application [17]. This reduces the intermediate reconstruction steps; a comparison of the measurement time needed for a prescribed precision requires a separate statistical analysis.
The bipartite case
For two parties, the theorem gives a nine-dimensional block and a one-dimensional block . The transformation from the orbit basis to the sector basis goes as follows.
A vector is -invariant iff it is of the form
in the orbit basis. Hence the only -invariant vector in has and the only -invariant vector in has . Summarising:
and the coordinate transformation in this basis transition is described by the transposed matrix:
All other orbit coordinates already match the product coordinates, up to their ordering. The two displayed directions have data coordinates and , respectively. The same transformation applies to the merged input.
In particular, the scalar response gives
For a normalized state, this isolates the difference between the global purity and . The known bipartite nine-plus-one factorization [16] is thus the first instance of the general sector reconstruction.
Partial transposition and information limits
Theorem 1 reconstructs all combinations retained by the cycle-merging map (3.13). To see why the discarded cycle orientations cannot be separated, recall that the three probability factors in Eq. (3) share each local setting. After Haar averaging, their local measurement coefficients obey
The two orientations therefore enter these equations only through their sum. The map records this information loss; inverting the averaged equations cannot recover their difference.
Let denote transposition on party . A negative eigenvalue of certifies entanglement between that party and the rest [34]; its moments can also support entanglement tests [35]. Partial transposition makes the lost cycle distinction explicit. Moving it from the state to the permutation operator in Eq. (37), using , gives
Thus it exchanges the two three-cycles at party alone; the identity and transpositions are unchanged. This differs from complex conjugation, which inverts every local label, and common copy relabelling, which conjugates every label by the same permutation.
Equation (8.2) exchanges the two cycle orientations at party , while maps both to . Consequently,
The discarded local direction is ; is spanned by tensors containing at least one such factor. These directions are removed before orbit reduction.
The same equality has a Born-rule explanation. Set , where the bar denotes entrywise conjugation. Equation (2.1) gives
This relates generally different settings; it does not equate the two expressions at the same . Applying Eq. (77) to each of the three factors in Eq. (3) gives, with ,
The change of variables preserves Haar measure and gives the last equality. Averaging therefore removes the distinction between the two settings, in agreement with Eq. (76). For two parties, partial transposition on interchanges and . Equation (4.6) retains only , so these correlators cannot determine without additional information.
To access independently only one can define for all an unbiased estimator , that does not need to be a density matrix [10, 15], such that where . In this approach, each shot retains both the random setting and the measured outcome [11]. Therefore to access only , the price to pay is an experiment where each applied setting must be recorded. Instead, in our protocol, we have access only to , but we only require that the same unknown acting on each copy of is Haar-distributed. Therefore the lack of information on turns into an easier and more economical experimental procedure.
In summary, the information limit proved here is forced by the common-setting Haar averages and Theorem 1 completes the reconstruction of what survives those averages.
Conclusion
We have determined which third-order local-unitary invariant combinations can be reconstructed from products of three outcome probabilities measured at a common local random setting and then averaged. For any number of parties, the theorem recovers all combinations retained by local cycle merging by accessing to the physical information with a symbolically inversion of matrices. This avoids to handle a numerical inversion of a matrix that explodes as the number of subsystems increases. The protocol to access those physical quantities uses independent local rotations, measurements on separately prepared copies, and classical processing, making it compatible with distributed experiments without the need of calibrating or storing each unitary. The result distinguishes information present in these correlators from information their equations cannot recover. In particular, the local Haar averages force the bipartite third moments and to appear only through their sum. The number of retained coordinates still grows exponentially, and the theorem does not establish favorable statistical cost or conditioning. Its practical appeal is that reconstruction does not require recording the applied unitary matrices. Developing efficient estimators for the retained combinations remains an open task, as does extending the analysis to higher orders.
Acknowledgements
We thank D. Chruściński, C. Lupo and M. Ziman for the fruitful scientific discussion. GSc is supported by grant NCN SONATA 21 UMO2025/59/D/ST2/02708. GSc thanks the Institute of Physics at the Slovak Academy of Sciences for its hospitality through the SAIA Support Fund.
References
Characters and dimensions of the invariant sectors
This appendix derives the dimensions of the invariant tensor sectors and verifies that their sum equals the orbit count . The required information is contained in the characters: the traces of the representation matrices.
For a representation on with character , averaging its matrices over the group projects onto . The average maps every vector to an invariant vector and acts as the identity on vectors already invariant. Its trace therefore equals the dimension of that subspace, giving [36]
The weights count the group elements in each conjugacy class. Thus invariant-subspace dimensions can be calculated without constructing a basis of the subspace of invariant vectors.
The pattern action in Eq. (19) gives the local characters
| class size | |||
The last row follows by subtracting the three invariant directions in from . Characters are constant on each conjugacy class, so these values specify all six group elements.
Since is a permutation representation, its trace counts local patterns invariant by the group element: the identity fixes all five, a transposition fixes , and its matching label, and a three-cycle fixes only , $E. A tuple of local is invariant under relabelling , . Equivalently, traces multiply under tensor products, so has class character . Averaging with the class sizes $1, 3, 2$ in Eq. (79) gives
This is also Burnside’s orbit-counting formula. It gives , , and , counting orbit coordinates rather than independent parameters of a normalized physical state.
For , the character of instead has class values
We calculate the dimension of its invariant subspace using the formula Eq. (79). At , the empty tensor product is one-dimensional and every group element acts as the identity, giving character values . Combining these cases yields
From measured frequencies to reconstruction coordinates
(69) takes representative orbit correlators as input. Measured event frequencies instead count all outcome triples belonging to a pattern orbit. This appendix converts those frequencies into the coordinates required by the inverse map in Eq. (25).
For an orbit , the corresponding event contains every outcome triple whose local equality-pattern tuple belongs to . Choose a representative . Using the local multiplicities introduced with Eq. (26), this representative has numerical outcome realizations. Common copy relabelling preserves every local type, so the same multiplicity applies to all pattern tuples in the orbit.
All these realizations have the same averaged correlator . The probability mass of the complete orbit event is therefore
Here counts pattern tuples, while the product counts numerical outcome realizations of each tuple.
To estimate , form triples from three distinct measurement shots at each product setting, as required by Eq. (2), and count the fraction belonging to the event .
For an orbit with nonzero outcome multiplicity, the representative-coordinate estimate is
Collecting these estimates in the prescribed orbit order gives , to which the reconstruction formula (7.7) applies.
References
- [1]S. J. van Enk and C. W. J. Beenakker, Physical Review Letters 108, 110503 (2012), arXiv:1112.1027.DOI
- [2]A. K. Ekert, C. Moura Alves, D. K. L. Oi, M. Horodecki, P. Horodecki, and L. C. Kwek, Physical Review Letters 88, 217901 (2002), arXiv:quant-ph/0203016.DOI
- [3]T. A. Brun, Measuring polynomial functions of states, Quantum Information and Computation 4, 401 (2004), arXiv:quant-ph/0401067.DOI
- [4]M. S. Leifer, N. Linden, and A. Winter, Physical Review A 69, 052304 (2004), arXiv:quant-ph/0308008.DOI
- [5]A. Elben, S. T. Flammia, H.-Y. Huang, R. Kueng, J. Preskill, B. Vermersch, and P. Zoller, Nature Reviews Physics 5, 9 (2023), arXiv:2203.11374.DOI
- [6]P. Cieśliński, S. Imai, J. Dziewior, O. Gühne, L. Knips, W. Laskowski, J. Meinecke, T. Paterek, and T. Vértesi, Physics Reports 1095, 1 (2024), arXiv:2307.01251.DOI
- [7]A. Elben, B. Vermersch, C. F. Roos, and P. Zoller, Phys. Rev. A 99, 052323 (2019), arXiv:1812.02624.DOI
- [8]A. Elben, B. Vermersch, M. Dalmonte, J. I. Cirac, and P. Zoller, Physical Review Letters 120, 050406 (2018), arXiv:1710.05060.
- [9]T. Brydges, A. Elben, P. Jurcevic, B. Vermersch, C. Maier, B. P. Lanyon, P. Zoller, R. Blatt, and C. F. Roos, Science 364, 260 (2019), arXiv:1806.05747.DOI
- [10]H.-Y. Huang, R. Kueng, and J. Preskill, Nature Physics 16, 1050 (2020), arXiv:2002.08953.DOI
- [11]A. Elben, R. Kueng, H.-Y. R. Huang, R. van Bijnen, C. Kokail, M. Dalmonte, P. Calabrese, B. Kraus, J. Preskill, P. Zoller, and B. Vermersch, Phys. Rev. Lett. 125, 200501 (2020), arXiv:2007.06305.DOI
- [12]Z. Liu, Y. Tang, H. Dai, P. Liu, S. Chen, and X. Ma, Physical Review Letters 129, 260501 (2022), arXiv:2203.08391.DOI
- [13]N. Wyderka and A. Ketterer, PRX Quantum 4, 020325 (2023), arXiv:2211.09610.DOI
- [14]A. Rath, R. van Bijnen, A. Elben, P. Zoller, and B. Vermersch, Physical Review Letters 127, 200503 (2021), arXiv:2102.13524.DOI
- [15]B. Vermersch, A. Rath, B. Sundar, C. Branciard, J. Preskill, and A. Elben, PRX Quantum 5, 010352 (2024), arXiv:2304.12292.DOI
- [16]G. Scala, A. Bera, and G. Sarbicki, Quantum Science and Technology 11, 015022 (2026), arXiv:2506.18303.arxiv.org/abs/2506.18303
- [17]G. Scala, C. C. Mattiacci, D. Pietryka, and G. Sarbicki, (2026), arXiv:2609.08635.arxiv.org/abs/2609.08635
- [18]D. Gross, K. Audenaert, and J. Eisert, Journal of Mathematical Physics 48, 052104 (2007), arXiv:quant-ph/0611002.DOI
- [19]A. A. Mele, Quantum 8, 1340 (2024), arXiv:2307.08956.DOI
- [20]H. Zhu, Phys. Rev. A 96, 062336 (2017), arXiv:1510.02619.DOI
- [21]B. Collins and P. Śniady, Communications in Mathematical Physics 264, 773 (2006), arXiv:math-ph/0402073.DOI
- [22]B. Collins, International Mathematics Research Notices 2003, 953 (2003), arXiv:math-ph/0205010.DOI
- [23]B. Collins, S. Matsumoto, and J. Novak, Notices of the American Mathematical Society 69, 734 (2022), arXiv:2109.14890.DOI
- [24]M. Grassl, M. Rötteler, and T. Beth, Physical Review A 58, 1833 (1998), arXiv:quant-ph/9712040.DOI
- [25]E. M. Rains, IEEE Transactions on Information Theory 46, 54 (2000), arXiv:quant-ph/9704042.
- [26]Y. Makhlin, Quantum Information Processing 1, 243 (2002), arXiv:quant-ph/0002045.
- [27]J. Kempe, Physical Review A 60, 910 (1999), arXiv:quant-ph/9902036.DOI
- [28]N. Linden, S. Popescu, and A. Sudbery, Physical Review Letters 83, 243 (1999), arXiv:quant-ph/9801706.
- [29]P. Vrana, Journal of Physics A: Mathematical and Theoretical 44, 115302 (2011), arXiv:1007.0163.DOI
- [30]P. W. Brouwer and C. W. J. Beenakker, Journal of Mathematical Physics 37, 4904 (1996), arXiv:cond-mat/9604059.
- [31]Z. Puchała and J. A. Miszczak, Bulletin of the Polish Academy of Sciences: Technical Sciences 65, 21 (2017), arXiv:1109.4244.
- [32]G. Scala, C. C. Mattiacci, and G. Sarbicki (2026), in preparation.
- [33]C. C. Mattiacci, G. Scala, and G. Sarbicki, 3-rd Order Symbolic Calculus, (2026), GitHub repository.
- [34]A. Peres, Physical Review Letters 77, 1413 (1996), arXiv:quant-ph/9604005.DOI
- [35]X.-D. Yu, S. Imai, and O. Gühne, Physical Review Letters 127, 060504 (2021), arXiv:2103.06897.DOI
- [36]J.-P. Serre, Linear Representations of Finite Groups, Graduate Texts in Mathematics, Vol. 42 (Springer-Verlag, New York, 1977).DOI