REVIEW 6 cited by
Unified Framework for Matchgate Classical Shadows
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Estimating quantum fermionic properties is a computationally difficult yet crucial task for the study of electronic systems. Recent developments have begun to address this challenge by introducing classical shadows protocols relying on sampling of Fermionic Gaussian Unitaries (FGUs): a class of transformations in fermionic space which can be conveniently mapped to matchgates circuits. The different protocols proposed in the literature use different sub-ensembles of the orthogonal group $O(2n)$ to which FGUs can be associated. We propose an approach that unifies these different protocols, proving their equivalence, and deriving from it an optimal sampling scheme. We begin by demonstrating that the first three moments of the FGU ensemble associated with $SO(2n)$ and of its intersection with the Clifford group are equal, generalizing a result known for $O(2n)$ and addressing a question raised in previous works. Building on this proof, we establish the equivalence between the shadows protocols resulting from FGU ensembles analyzed in the literature. Finally, from our results, we propose a sampling scheme for a small sub-ensemble of matchgates circuits that is optimal in terms of number of gates and that inherits the performances guarantees of the previous ensembles.
Forward citations
Cited by 6 Pith papers
-
No-go theorems for sublinear-depth group designs
Any group with an invariant state cannot have approximate k-designs built from sublinear-depth local circuits; linear depth is necessary for matchgate, orthogonal, symplectic, Clifford (k=8), and mixed-unitary group designs.
-
Optimal Haar random fermionic linear optics circuits
The paper constructs optimal-depth, optimal-gate-count quantum circuits that sample Haar-random active and passive fermionic linear optics unitaries directly from angle distributions, plus an optimal Clifford FLO sampler.
-
Adaptive-depth randomized measurement for fermionic observables
A depth-adaptive fermionic classical shadow protocol achieves polynomial sample complexity at depth max{d_int^2/log n, d_int}, where d_int is the observable's interaction distance.
-
Certified Optimal Measurement Reduction over Quantum Context Landscapes
A second-order cone program certifiably minimizes the shot cost of quantum Hamiltonian measurement over any declared context dictionary, with independently checkable lower-bound witnesses, validated on molecules and 2...
-
Matrix Elements of Fermionic Gaussian Operators in Arbitrary Pauli Bases: A Pfaffian Formula
Every matrix element of a fermionic Gaussian operator between arbitrary Pauli product states is expressed as a single Pfaffian of a 2L by 2L kernel with explicitly tabulated sign matrices.
-
Classical Shadows with Improved Median-of-Means Estimation
Applying Minsker's tighter median-of-means estimator with incomplete U-statistics to classical shadows improves sample efficiency for Clifford measurements but not for Pauli measurements.
Discussion (0). Continue with ORCID to comment.