arXiv:2609.40095
Classical Shadows with Selective GHZ Measurements
Nicolas Faroß, Marc Wanner, Pingal Pratyush Nath, Akshay Gaikwad, Anton Frisk Kockum, Devdatt Dubhashi
Abstract
Classical shadows allow the prediction of many quantum-state properties from measurement data, but their efficiency strongly depends on the underlying measurement ensemble. We introduce selective GHZ measurement (SGM) shadows, which perform Greenberger-Horne-Zeilinger (GHZ)-basis measurements on randomly selected subsets of qubits and computational-basis measurements on their complement. The corresponding quantum circuits are practically feasible, with their number of CNOT gates scaling linearly with the number of qubits. This is in stark contrast to global Clifford circuits, which are generally difficult to implement. Varying the subset distribution allows tuning the SGM shadow protocol for different classes of observables with prescribed X/Y support, allowing us to outperform local Pauli as well as global Clifford shadows in certain scenarios. We determine the exact shadow channel and its inverse for arbitrary subset distributions and prove an explicit bound on the shadow norm using methods from discrete Fourier analysis and Markov semigroup theory. For natural choices of subset distributions, this gives a polynomial scaling for observables with fixed X/Y-locality. Numerical simulations of up to 50 qubits support the predicted improvements for nonlocal observables and long-range systems, and demonstrate the practical benefits of our protocol's generality by showing how the subset distributions can be tailored to settings such as fermionic modes under the Jordan-Wigner transformation.
AI Summary
The paper asks whether structured, nonlocal observables can be estimated with classical shadows using simpler circuits than global Clifford measurements. It introduces selective GHZ measurements: sample a qubit subset $s$ from a distribution $p$, measure it in one of two GHZ bases, and measure its complement computationally. Circuits use $O(|s|)$ CNOTs and admit logarithmic depth with suitable connectivity. The shadow channel is computed exactly. For a Pauli $P_{a,b}$ with $X/Y$-support mask $a$, its eigenvalue is $p(a)/2$ when $a\ne0$, and $(1+\widehat p(b))/2$ otherwise. Strictly positive $p$ therefore ensures invertibility. For Hermitian $A$ supported on masks in $S$, the main bound is $\|A\|_{\mathrm{sh}}^2\le(6+\pi)\max_{s\in S}p(s)^{-1}\|A\|_\infty^2$. The proof combines a Pauli-sector decomposition with discrete Fourier analysis and a reverse Poincaré inequality for a graph heat semigroup. Independent subset inclusion with probability $1/(n+1)$ gives $\|A\|_{\mathrm{sh}}^2\le(6+\pi)e n^k\|A\|_\infty^2$ when each Pauli term has at most $k$ $X/Y$ factors, irrespective of its $Z$ support. Complementary support classes also receive polynomial guarantees, covering exponentially many Pauli observables. Simulations up to 50 qubits examine nonlocal observables; fermionic reduced-density-matrix examples use tailored distributions and retain $O(n^{2k})$ scaling. The protocol does not uniformly outperform Pauli or Clifford shadows. Stated open issues include sharper bounds and constants, possible benefits from $p(0)=0$, noise robustness, limited-connectivity implementation costs, and identifying further applications.
ChatGPT 5.6 Sol was used for searching the literature, proofreading, improving wording and developing proof ideas.
Error found: The abstract claims a shadow-channel inverse for arbitrary subset distributions, although distributions concentrated on the empty subset give a noninvertible channel; the body's inverse and main shadow-norm guarantees explicitly require additional assumptions.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 53 pages, 4 figures